SENSITIVITY ANALYSIS IN BILEVEL LINEAR PROGRAMMING

1.IntroductionMultilevelprogrammingmodelsdescribesdecisionmakingsituationswhereahierarchyexists.Inabilevelsystem,thedecisionofthehigherlevel(leader)mayaffectthechoiceofstrategyavailabletothelowerlevel(follower)whoattemptstooptimizehisobjectivefunction.Inthissystem,theleaderalsoconsidersthefollower'sresponsewhichisbasedonoptimizingthefollower'sobjectivefunction,forinstance,see[1].Asanextensionandavariationofmathematicalprogramming,multilevelprogrammingwasfirstintroducedbyCandlerandTownsley[2].…     

A HYBRID POLYNOMIAL ALGORITHM FOR LINEAR PROGRAMMING

ＡＨＹＢＲＩＤＰＯＬＹＮＯＭＩＡＬＡＬＧＯＲＩＴＨＭＦＯＲＬＩＮＥＡＲＰＲＯＧＲＡＭＭＩＮＧ￥ＨＵＡＮＧＳａｉｎｇ（ＤｅｐａｒｔｍｅｎｔｏｆＩｎｆｏｒｍａｔｉｏｎａｎｄＳｙｓｔｅｍｓＭａｎａｇｅｍｅｎｔ，ＣｏｌｌｅｇｅｏｆＢｕｓｉｎｅｓｓａｎｄＭａｎ...     

1/2-TRANSITIVE GRAPHS ASSOCIATED WITH LINEAR GROUPS

１／２－ＴＲＡＮＳＩＴＩＶＥＧＲＡＰＨＳＡＳＳＯＣＩＡＴＥＤＷＩＴＨＬＩＮＥＡＲＧＲＯＵＰＳ￥ＤＵＳｈａｏｆｅｉ（ＤｅｐａｒｔｍｅｎｔｏｆＭａｔｈｅｍａｔｉｃｓ，ＳｈａｎｘｉＵｎｉｖｅｒｓｉｔｙ，Ｔａｉｙｕａｎ０３０００６，Ｃｈｉｎａ）Ａｂｓｔｒａｃ...     

A MODIFIED HOMOGENEOUS AND SELF-DUAL LINEAR PROGRAMMING ALGORITHM

ＡＭＯＤＩＦＩＥＤＨＯＭＯＧＥＮＥＯＵＳＡＮＤＳＥＬＦ－ＤＵＡＬＬＩＮＥＡＲＰＲＯＧＲＡＭＭＩＮＧＡＬＧＯＲＩＴＨＭ￥ＧＵＯＴｉａｎｄｅ（ＭａｔｈｅｍａｔｉｃｓＤｅｐａｒｔｍｅｎｔ，ＱｕｆｕＮｏｒｍａｌＵｎｉｖｅｒｓｉｔｙ，Ｑｕｆｕ２７３１６５，Ｃｈ...     

A ROBUST DECOMPOSITION OF LINEAR PROGRAMMING USING A GOAL-PARTITIONING METHOD

The Dantzig/Wolfe linear programming decomposition algorithm has had important economicinterpretations as well as a widespread impact on solving large scale linear programming problem.Inthis paper we consider a similar underlying structure,where however there is only one couplinginequality or equation.With this simplification,we demonstrate how to achieve an equitable partitionof the overall coupling resource to individual subproblem constraints through a simple iterationprocedure which appears to be very efficient.     

A FAST PROCEDURE OF VARIABLE SELECTION IN LINEAR REGRESSION MODEL

In many situations,we are interested in selection of important variables whichare adequate for prediction under a linear regression model.In this paper,a fast selectionprocedure is proposed and is proved to be strongly consistent.Also,the convergence rate ofmisjudgement probability is given.     

THE EQUIVALENCE CLASSES OF LRS OVER Z_p~e

1.IntroductionLetpbeaprasenumber,eapositivenumber,ZretheresidueringofZmoduloP".Letfi=(Zve)oo={g=(al)iZolaiEZap}.Asequenceg=(al)iZoinniscalledalinearrecurringsequence(LRSinshort)overZPeifitsatisfiesthelinearrecurrencerelationan i=on--fan--1 i '' toal,i=0,1,...(1.1)whereCiEZreffor0SiSn--1,andthemonicpolynomialiscalledthecharacteristicpolynomialofg.Denotethesetofailsequencessatisfyinglinearrecurrencerelation(1.l)byn(f).Next,werequirethatj(x)satisfiesgcd(f(0),p)=1,theneverysequenceg=(ac)i…     

THE POLE ASSIGNMENT OF LINEAR SYSTEMS

In this paper the pole assignment problem of a time invariant linear control system issolved by using the Wu Elimination Method.In general,the questions are classified into(i)the poleassignment by using state feedback,(ii)the pole assignment by using output feedback,(iii)the poleassignment via dynamic compensator.The key point of all these problems is to solve a certaincorresponding system of polynomial equations.Based on algebraic geometry,the Wu methodprovides a mechanical algorithm for solving the system of polynomial equations.Therefore,a unifieddefinite algorithm for solving all these problems is given in this paper.During the procedure ofelimination,the unknowns are automatically separated into parameters and apparent variables.Thus,the freedom of the corresponding feedback can be defined as the number of parameters.Meanwhile,the explicit expressions of the apparent variables depending on the parameters areobtained.     

A HYBRID METHOD FOR LINEAR PROGRAMMING

1.IntroductionItiswellknownthatsinceKaxmarkax[1]proposedthefirstinferiorpoilltmethod,manyexpertshavebeeninvolvedtoimproveandcompletethismethod.ThereisalotofprogressinthisareaandmanyinteriorpointmethodsaredevelOPed;theinterestedreaderisreferredtotheexcellentbooksofhoandPllthenpura[2]andNesterovandNemirovskiil3].TheseiDteriorpointmethodscanbeclassifiedroughlyintothreecategories:(i)potentialreduction,(n)affinescaling,and(iii)path-following.Theaffine-scalingmethodisshowntoworkwellinpracticebyta…     

ON THE SECOND GREEDY WEIGHT FOR LINEARCODES SATISFYING THE FULLRANK CONDITION

The maximum of g2-d2 for linear [n, k, d; q] codes C is studied. Here d2 is the smallest size of the support of 2-dimensional subcodes of C and g2 is the smallest size of the support of 2-dimensional subcodes of C which contains a codeword of weight d. The extra cost to the greedy adversary to get two symbols of information using some algorithm is g2-d2. For codes satisfying the fullrank condition of general dimensions, upper bounds on the maximum of g2-d2 are given. Under some condition we have got code C where g2-d2 reaches the upper bound.     

STABILITY AND FEEDBACK CONTROL OF A CLASS OF SECOND-ORDER LINEAR SYSTEMS IN BANACH SPACE

In this paper. we are concerned with the stability and control problem for aclass of second-order linear systems in Banach space. First. a criterion for the exponentialstability of a first-order linear system is presented. Then. the exponential stability as wellas some properties of a class of second-order linear systems is proved. At last. the feedbackcontrol of this class of systems is investigated.     

线性测量误差模型及其诊断

利用校正似然法对讨论了系统分析中测量误差的设计问题,在此基础上讨论了该模型的诊断,并给出了若干个诊断统计量,数值实例表明本文的方法是比较有效的。     

FORWARD-BACKWARD STOCHASTIC DIFFERENTIAL EQUATIONS, LINEAR QUADRATIC STOCHASTIC OPTIMAL CONTROL AND NONZERO SUM DIFFERENTIAL GAMES

In this paper, we use the solutions of forward-backward stochastic differential equations to get the explicit form of the optimal control for linear quadratic stochastic optimal control problem and the open-loop Nash equilibrium point for nonzero sum differential games problem. We also discuss the solvability of the generalized Riccati equation system and give the linear feedback regulator for the optimal control problem using the solution of this kind of Riccati equation system.     

单关联线性规划的最优化解法

用最优化搜索方法解决一类单关联线性规划［１］问题．对大规模线性规划，由于状态变量数太多，受微机内存容量限制，用通常的单纯形法解决不了．当规划约束条件是单关联时，用最优化解法可以克服这一困难．同时当约束条件不合理时，规划常常是无解的，但用这种最优化解法，则比较容易查清原因，调整不合理的约束，使问题得到解决．     

用专家系统方法建立线性规划模型

线性规划是管理决策领域中常用的基本工具之一,我们开发了一个建立线性规划模型的专家系统原型LPES。该系统用户界面友好,面向实际生产和商业规划领域,采用规则-框架相结合的复合知识表示形式,实现了数值计算与符号处理的有机结合。本文着重介绍了其知识库系统并通过一个例子简要说明了模型综合的思想。     

一种区间数线性规划的满意解

针对目标函数和约束条件均为区间数的线性规划问题，提出了一种基于模糊约束满意度的求解方法，把区间数线性规划卖座经为确定型的一般参数规划问题来求解，决策者可以根据自己的主观判断和客观情况，对目标函数优化水平和约束条件满意水平作出不同的估计，从而得到在相应情况下的满意解，使决策过程更具柔性。     

THE DEGENERACY PROBLEM OF TWO-DIMENSIONAL LINEAR RECURRING ARRAYS

1.IntroductionInthepastthreedecadestwcadimensionalarrayswereextensivelystudiedsincetheycanbeusedintwo-dimensionalrange-finding,scramming,two-dimensionalcycliccodesandotherapplicationsincommunicationandcoding.Therearetwotypesoftwo-dimensionalarrays.Th...     

A CUTTING PLANE METHOD FOR LINEARBILEVEL PROGRAMS

1.IntroductionThebilevelprogr~ngproblem(BLPP),anoptimizationproblemwithaspecialconstraintfunctionwhichisimplicitlydeterminedbyanotheroptimizationproblem,hasreceivedmuchatteDtionofresearchersduringthelastdecade.Falkll]pioneeredtheworkbystudyingthegeneralmad-minproblem,aspecialcaseoflinearBLPP,andproposedamethodbasedonbranch-and-boundandlinearprogrammingtechniques.BialasandKar.an[2]investigatedthegeometricpropertiesofthefeasibleregionofthelinearBLPPandshowedthatsolutionsoftheproblemmayoccu…     

ON THE LINEAR PREDICTABILITY TEST FOR ENCIPHERING SEQUENCES

ＯＮＴＨＥＬＩＮＥＡＲＰＲＥＤＩＣＴＡＢＩＬＩＴＹＴＥＳＴＦＯＲＥＮＣＩＰＨＥＲＩＮＧＳＥＱＵＥＮＣＥＳ￥ＺＥＮＧＫｅｎｃｈｅｎｇ；ＤＡＩＺｏｎｇｄｕｏ（ＳｔａｔｅＫｅｙＬａｂｏｒａｔｏｒｙｏｆｉｎｊｏｒｍａｔｉｏｎＳｅｃｕｒｉｔｙ，Ａｃａｄｅｍｉａ...     

一种基于单亲遗传算法的petri网发射路径求解算法

给出了一种基于单亲遗传算法的petri网发射路径求解算法，提出了裂解和聚合两种新的单亲遗传算法算子。算法通过对染色体中的染色体片段进行裂解和聚合等操作，实现了发射序列的快速求解。仿真结果表明，本算法能够以较大的收敛概率快速地收敛，最终得到多个发射序列。进一步的研究表明，适当的选取样本空间的大小可以使本算法更加快速高效。