A Compromise Approach to Lexicographic Optimal Solution in Multiple Objective Programming

ＡＣｏｍｐｒｏｍｉｓｅＡｐｐｒｏａｃｈｔｏＬｅｘｉｃｏｇｒａｐｈｉｃＯｐｔｉｍａｌＳｏｌｕｔｉｏｎｉｎＭｕｌｔｉｐｌｅＯｂｊｅｃｔｉｖｅＰｒｏｇｒａｍｍｉｎｇＸＵＪｉｕｐｉｎｇＤｅｐａｒｔｍｅｎｔｏｆＡｐｐｌｉｅｄＭａｔｈｅｍａｔｉｃｓ，Ｃｈｅｎｇｄ...     

Determining the Optimal Solution Set for Linear Fractional Programming

1 .ＩＮＴＲＯＤＵＣＴＩＯＮＬｉｎｅａｒｆｒａｃｔｉｏｎａｌｐｒｏｇｒａｍｍｉｎｇｒｅｆｅｒｓｔｏｎｏｎｌｉｎｅａｒｐｒｏｇｒａｍｍｉｎｇｐｒｏｂｌｅｍｓｏｆｏｐｔｉｍｉｚｉｎｇｔｈｅｒａｔｉｏｏｆｔｗｏｌｉｎｅａｒｆｕｎｃｔｉｏｎｓｉｎｔｈｅｐｒｅｓｅｎｃｅｏｆｌｉｎｅａｒｃｏｎｓｔｒａｉｎｔｓ .Ｉｎｇｅｎｅｒａｌ,ｔｈｅｏｐｔｉｍａｌｓｏｌｕｔｉｏｎｏｆｔｈｅｍａｔｈｅｍａｔｉｃａｌｐｒｏｇｒａｍ ｍｉｎｇｆｏｒｍｅｄｉｎａｃｔｕａｌｂｕｓｉｎｅｓｓｍａｎａｇｅｍｅｎｔｓｉｔｕａｔｉｏｎｓｐｒ…     

The Optimal Method of Experiment for Multidimensional Dynamic Programming

ＴｈｅＯｐｔｉｍａｌＭｅｔｈｏｄｏｆＥｘｐｅｒｉｍｅｎｔｆｏｒＭｕｌｔｉｄｉｍｅｎｓｉｏｎａｌＤｙｎａｍｉｃＰｒｏｇｒａｍｍｉｎｇＣＨＥＮＧＪｉｎｌｉｎ；ＪＩＮＺｈａｎｓｅｎ（ＪｉａｎｇｓｕＡｇｒｉｃｕｌｔｕｒａｌＣｏｌｌｅｇｅ，Ｊｉａｎｇｓｕ，２２...     

The Uniqueness of Optimal Solution for Linear Programming Problem

This paper investigates an old problem in operations research, the uniqueness of the optimal solution to a linear programming problem. We discuss the problem on a general polyhedron, give some equivalent conditions for uniqueness testing. In addition, we discuss the implementation issues for linear programming based decision making procedures,which motivated this research.     

The Class of the Generalized αk-Major Efficient Solutions for Multi-objective Programming

1 IntroductionConsider the following multi--objective programming:V -- minf(x) Cl)x e xwhere XcrR" is a constrained set, and f: R"-R"(m22) is the vector objective function.A non--dominated solution for (1 ) is usually called the Pareto efficient solution. HuL1jintroduced the concepts of major efficient solutions and major optimal solutions, thenpresented the concepts of a--major efficient so1utions and a--major optimal solutions. Ma[2Jgave a genera1ization of the major optimal solutions, a…     

A Mathematical Model of Real-Time Simulation and the Convergence Analysis on Real-Time Runge-Kutta Algorithms

In this paper, a mathematical model of real-time simulation is given, and the problem of convergence on real-time Runge-Kutta algorithms is analysed. At last a theorem on the relation between the order of compensation and the convergent order of real-time algorithm is proved.     

Optimal Budget Spending for Software Testing under the Condition of Nonlinear Constraint

Software testing is a very important phase of the software development process. It is a very difficult job for a software manager to allocate optimally the financial budget to a software project during testing. In this paper the problem of optimal allocation of the software testing cost is studied. There exist several models focused on the development of software costs measuring the number of software errors remaining in the software during testing. The purpose of this paper is     

Analysis for Influence of Market Information on Firms＇ Optimal Strategies in Multidimensional Bertrand Game

The Bertrand model of two firms‘ static multidimensional game with incomplete information for two kinds of product with certain substitution is discussed in the paper,and analyzes influences of the firms‘ forecasting results of total market demands on their optimal strategies according to marxet information. The conclusions are that the more a firm masters market information, the greater differences of forecasted values and expected values of market demands for products have influence upon equilibrium strategies; conversely, the less they have influence upon equilibrium strategies.     

A Cognitive Science Framework for the Analysis of Knowledge-Based Systems

ＡＣｏｇｎｉｔｉｖｅＳｃｉｅｎｃｅＦｒａｍｅｗｏｒｋｆｏｒｔｈｅＡｎａｌｙｓｉｓｏｆＫｎｏｗｌｅｄｇｅ－ＢａｓｅｄＳｙｓｔｅｍｓＦｅｎｇＳｈａｎ（ＤｅｐａｒｔｍｅｎｔｏｆＡｕｔｏｍａｔｉｃＣｏｎｔｒｏｌＥｎｇｉｎｅｅｒｉｎｇ，ＨｕａｚｈｏｎｇＵｎｉｖ...     

Evaluation for Rationalization of the Industrial Structure Based on Grey Relevancy Degree

Rationalization of Industrial Structure is essential characteristic of economic development and key to promote sustained, stable, coordinated economic development as well. Based on Grey Relevancy Degree, the paper is to analyze industry structure in Wenzhou, China. And give the evaluation for rationalization of industrial structure.     

基于多目标规划的扩展DEA有效性分析

为避免传统的DEA模型在评价决策单元的相对有效性存在的局限,建立了多目标规划的DEA模型(MP),讨论了MP的一些性质。在此基础上给出了关于决策单元的扩展DEA有效性的几个等价命题,并对决策单元扩展有效的灵敏度进行了讨论。     

Connectedness of G—proper Efficient Solution Set for Multiobjective Programming Problem

1　 IntroductionWe know that one of the mostimportant problems of multiobjective programming is to in-vestigate the structure of efficientsolution sets. Among the topological properties of thesesets,connectedness is of interest.In Euclidean space,many results have been obtainedabout the connectedness of efficient solution set in past.The set of efficient solution isconnected when the objective functions are strictly quasiconcave[1 ] .In general,efficientsolution set is so large for multiobjec…     

一种指标权重信息不完全的多指标决策方法

针对指标权重信息不完全的多指标决策问题,提出了一种逼近于理想解的决策分析方法。首先,对指标权重信息不完全的多指标决策问题进行了描述;然后,依据传统的TOPSIS方法的基本思路,给出了解决指标权重信息不完全的多指标决策问题的方法的计算步骤,其核心是通过构建并求解二次规划模型,得到每个方案与正、负理想解间的距离,进而通过计算出相对接近度,即可得到所有方案的排序结果。最后,给出了一个算例。     

一种证券组合投资的模糊多目标规划方法

考虑了证券投资的预期收益率和风险的模糊性 ,利用多样化选择约束抵减证券投资的非系统风险 ,以证券组合投资的收益率极大化和β值极小化为目标 ,建立了一种新的基于模糊多目标规划的证券投资决策模型 ,指出了模型的求解方法 .     

一种不确定性多属性决策模型的改进

针对具有不确定性区间数的多属性决策问题, Ｂｒｙｓｏｎ 和Ｍｏｂｏｌｕｒｉｎ 提出了一种线性规划模型, 但是, 采用由该模型求出的所有方案评价值所在的区间在很大程度上并不是使用同一个属性权重向量, 这就使得所有的方案排序（或评价）不具有可比性． 为了解决这个问题, 该文提出了一种改进的模型, 并且给出了实例计算．     

区间非线性规划问题的确定化描述及其递阶求解

讨论以区间参数形式给出的不确定性非线性规划问题,提出了一种含有决策风险因子的新的区间参数不确定非线性规划的一般命题形式,并分别就不确定性参数出现在目标函数或约束条件中的不同情况,给出不同的表达形式.文章给出用遗传算法,采用递阶优化方式求解区间参数不确定非线性规划的具体算法.仿真结果表明该形式的可行性.     

多目标决策的柔性电压控制

提出了一种新的电压稳定控制方法.基于帕雷托优化解集,多目标决策技术被用来实现对于电力系统电压稳定性的柔性控制.电压控制是一个多目标优化问题.首先用基因跳跃进化算法作为离线搜索的方法,寻找出帕雷托优化解集.当控制系统在线应用时,帕雷托优化解集提供了一系列可行解.多目标决策技术能够根据不同的控制需求选择其中之一,满足不同的操作参数选择.从而实现了对于电压稳定的柔性控制.这种基于多目标决策的控制策略提供了快速、柔性的系统响应.对于6母线的电力系统仿真证实了这一新方法的有效性.     

基于粗集理论的多目标规划问题的约束度分析

给出了有冗余约束条件的多目标规划问题的模型约简方法。对于无冗余约束条件的决策系统 ,决策者可通过对约束条件的重要性分析而按其重要性大小适当删除不重要约束 ,从而得到原问题的核心约束条件组和相应核心有效解。原问题的有效解和核心有效解的关系可以用粗糙近似来刻画。用算例说明了这种方法的应用。     

A Way to Find All the Optimal Solutions in Linear Programming

1.INTRoDUCTIoNIngeneral,theoptimalsolutionsformedinactualbusinessmanagementsituationsprovidethebesteoforcemelltplansinthegivenpracticalproblems.Whenthereismoretha-noneoptimalsolutioninlinearprogramming,thereekistsunlimitednumberofoptimalsolutions.Tofindthemultipleoptimalsolutionsinlinearprogradringisaverysignificantwork,becausethedecisionmakercanbegivenmoreoptimalplanstochoosefrom.Sofar,therehavebeenmanypaPersdiscussingthesituationofunliIintedoptimalsolutions.However,therearendstthesandde…