三元区间数线性规划及其解法

在三元区间数理论的基础上,提出了三元区间数线性规划模型的一般形式.利用三元区间数的弱偏好序关系,定义了三元区间数线性规划的弱可行解和弱最优解,并将它的弱最优解转化为求三个一般线性规划模型的最优解,从而在理论上对区间数线性规划进行拓展.最后,通过数值例子对该理论及模型求解方法进行说明和验证.     

Further Analysis of an Outcome Set-Based Algorithm for Multiple-Objective Linear Programming

Various difficulties have been encountered in using decision set-based vector maximization methods to solve a multiple-objective linear programming problem (MOLP). Motivated by these difficulties, Benson recently developed a finite, outer-approximation algorithm for generating the set of all efficient extreme points in the outcome set, rather than in the decision set, of problem (MOLP). In this article, we show that the Benson algorithm also generates the set of all weakly efficient points in the outcome set of problem (MOLP). As a result, the usefulness of the algorithm as a decision aid in multiple objective linear programming is further enhanced.     

Geometric Algorithm for Multiparametric Linear Programming

We propose a novel algorithm for solving multiparametric linear programming problems. Rather than visiting different bases of the associated LP tableau, we follow a geometric approach based on the direct exploration of the parameter space. The resulting algorithm has computational advantages, namely the simplicity of its implementation in a recursive form and an efficient handling of primal and dual degeneracy. Illustrative examples describe the approach throughout the paper. The algorithm is used to solve finite-time constrained optimal control problems for discrete-time linear dynamical systems.     

求解线性二层规划问题的多表旋转算法

多表旋转算法是一种基于旋转算法来求解线性二层规划问题的方法,通过表格组合还可以求解线性多层规划、以及线性一主多从有关联的stackelberg-nash均衡等问题,求解的思想是使用旋转算法,在多个主体间通过约束传递达到均衡。通过算例显示该方法可以迅速地算出局部最优解,如果问题的诱导域是连通的,还可以计算出全局最优解。     

区间数线性规划问题的最优性条件

分别讨论了区间数线性规划问题保守可能解、保守必然解、冒进可能解和冒进必然解的最优性条件。     

线性规划全方位变化的灵敏度分析

本文对变量目标函数系数、变量约束系数向量以及约束右端项向量同时变化进行灵敏度分析。不仅对变化后可能出现的各种情况进行分析处理,尤其在对偶可行性和可行性都不满足时,利用联合算法进行处理,并通过算例加以说明。     

New Branch-and-Cut Algorithm for Bilevel Linear Programming

Linear mixed 0–1 integer programming problems may be reformulated as equivalent continuous bilevel linear programming (BLP) problems. We exploit these equivalences to transpose the concept of mixed 0–1 Gomory cuts to BLP. The first phase of our new algorithm generates Gomory-like cuts. The second phase consists of a branch-and-bound procedure to ensure finite termination with a global optimal solution. Different features of the algorithm, in particular, the cut selection and branching criteria are studied in details. We propose also a set of algorithmic tests and procedures to improve the method. Finally, we illustrate the performance through numerical experiments. Our algorithm outperforms pure branch-and-bound when tested on a series of randomly generated problems. Work of the authors was partially supported by FCAR, MITACS and NSERC grants.     

Kuhn-Tucker条件与线性规划的对偶性

证明了线性规划的K uhn-Tucker条件蕴含着它的对偶问题,解释了L agrange乘子的意义.进而显示了K-T条件中的互补松驰性与对偶线性规划的互补松紧定理之间的联系.     

求解多层线性规划的模糊规划法

本文用模糊集理论中的隶属函数描述多层线性规划的各层目标,在第一层给定最小满意水平下,通过求解相应层次的模糊规划来确定各层的最小满意度,从而最终得到问题的一个满意解。提出的方法只需求解一系列线性规划问题,具有较好的计算复杂性和可行性,最后的算例进一步验证了方法的有效性。     

关于线性算子的概率范数与算子空间

由于满足(PN-5)条件的PN空间(E,F)就是MangerPN空间(E,F,min),因此,肖建中等给出的关于PN空间上线性算子概率范数的结果有较大的局限性.本文中,在较一般的MengerPN空间上研究有关线性算子的概率范数和算子空间的问题,改进和推广了肖建中等的结果.     

基金最佳使用计划的线性规划模型

给出了基金存款策略的线性规划模型 .对基金 M使用 n年的情形 ,只需比较银行存款税后年利率 ,初步确定 n年内的一切可能有的基金存款方式及其到期本利率 ,通过基金流转分析 ,即可建立以最大奖金数为目标的线性规划模型 ( LP1 ) n;问题二则需先分析 n年内一切可行的存款和购国库卷的组合方式及其到期的最佳本利率 ,然后调整模型 ( LP1 ) .中有关的系数 ,即可得到模型 ( LP2 ) n,调整模型 ( LP1 ) n与 ( LP2 ) n中第三年的奖金 y的系数 ,即可得到问题三的线性规划模型 .本文用 SAS/OR软件求解上述模型 ,得到在 n=1 0 ,M=5 0 0 0的情形下 ,使每年奖金数为最大的各种问题的基金的最佳使用策略 .     

Conditions and Algorithm for Optimal Solution of Probabilistic Constrained Programming

1.IntroductionAsweknow,theerroralwaysexistsinmeasurementanditisnormallydistributed,soweconsideraprobabilisticconstrainedprogrammingasbelow:WhereAeRTxnisastochaJsticmatrix,A1)A2,...,A.aretherowsofAandeachAinormallydistributedwithmeanmiandcovariancematrixDi,BER"x"isdeterministicmatrix,xisann-dimensionaldecisionvariable,b,c,daredeterministicvectorsofdimensionrtnfmrespectively,pisconstantreliabilitylevel,1相似文献   

Maximum Feasibility Problem for Continuous Linear Inequalities with Applications to Fuzzy Linear Programming

Systems of linear inequalities are important tools to formulate optimization problems. However, the feasibility of the whole system was often presumed true in most models. Even if an infeasible system could be detected, it is in general not easy to tell which part of the system caused it. This motivates the study of continuous linear inequalities, given no information whether it is feasible or not, what is the largest possible portion of the system that can be remained in consistency? We first propose a bisection-based algorithm which comes with an auxiliary program to answer the question. For further accelerating the algorithm, several novel concepts, one called “constraint weighting” and the other called “shooting technique”, are introduced to explore intrinsic problem structures. This new scheme eventually replaces the bisection method and its validity can be justified via a solid probabilistic analysis. Numerical examples and applications to fuzzy inequalities are reported to illustrate the robustness of our algorithm.     

线性规划增减约束条件的灵敏度分析

本文在灵敏度分析的基础上,面对增减约束条件,特别对减少约束的情形,给出新最优方案的获得方法;并指出其特殊的经济意义。     

应用模糊目标规划方法求解多目标线性分式规划问题

针对多目标分式线性规划问题,提出利用上(下)界表示目标期望水平及允许上(下)限,且利用一阶泰勒公式逼近隶属函数,将多目标分式规划转化为线性规划问题,并用单纯形法求解,通过实验算例说明了所提出的方法的有效性.     

基于遗传算法的二层线性规划问题的求解算法

本研究了下层以最优解返回上层的二层线性规划问题的遗传算法。在提出可行度概念的基础上，构造了二层线性规划上层规划问题的适应度函数，由此设计了求解二层线性规划问题遗传算法。为了提高遗传算法处理约束的能力，在产生初始种群时将随机产生的初始种群变为满足约束的初始种群，从而避免了使用罚函数处理约束带来的困难，最后用实例验证了本提出的二层线性规划的遗传算法的有效性。     

An Algorithm for Approximate Multiparametric Linear Programming

Multiparametric programming considers optimization problems where the data are functions of a parameter vector and describes the optimal value and an optimizer as explicit functions of the parameters. In this paper, we consider a linear program where the right-hand side is an affine function of a parameter vector; we propose an algorithm for approximating its solution. Given a full-dimensional simplex in the parameter space and an optimizer for each simplex vertex, the algorithm formulates the linear interpolation of the given solutions as an explicit function of the parameters, giving a primal feasible approximation of an optimizer inside the simplex. If the resulting absolute error in the objective exceeds a prescribed tolerance, then the algorithm subdivides the simplex into smaller simplices where it applies recursively. We propose both a basic version and a refined version of the algorithm. The basic version is polynomial in the output size, provided a polynomial LP solver is used; the refined version may give a smaller output. A global error bound for the optimizer is derived and some computational tests are discussed.     

综合型模糊线性规划分析

模糊线性规划问题是模糊数学规划的研究基础，已经有许多学在这一领域取得了卓有成效的研究成果。但这些研究都是针对特定类型的模糊线性规划开展的，而没有将模糊线性规划放在一般环境下进行综合考虑。本对模糊线性规划的一般模型进行了分析，提出了综合型模糊线性规划问题的求解方法。     

一种可用于资金分配的线性规划模型

本运用DEA方法,给出了一种能够用来进行资金分配决策的线性规划模型,并证明了其最优解的存在性。     

紧急输送策略的线性规划模型

以美国南弗洛里达州递避飓风袭击为例建立了紧急输送情况下的线性规划模型。其中具体建立了以SCEPD(美国南弗洛里达州紧急情况预防部门)提出的公路反向，地区分块撤离，使用小路等三个最受人们关注的策略的模型。模型的灵敏度分析能很好地解释建立更多的临时避难所、限制车辆等策略对撤离的影响。在相近的环境下，中模型解得的结果很接近官方预测的结果，并且本的模型能对更广泛的情况进行分析．可给SCEPD提供一定参考。