共查询到19条相似文献,搜索用时 171 毫秒
1.
求解群体多目标凸规划的一个交互规划算法 总被引:3,自引:0,他引:3
本文给出一个由决策群体求解带有非线性约束的多目标凸规划问题的交互规划算法。此法通过决策群体与分析者之间以及各决策者之间的交互,最终得到群体满意的有效解,本文还证明了这一算法的收敛性定理。 相似文献
2.
群体多目标决策联合有效解类的几何特性 总被引:2,自引:0,他引:2
群体多目标决策是群体决策和多目标决策的一个交叉研究领域,借助供选方案的有效数,文[1]引进了群体多目标决策问题的联合有效解类概念,并且建立了这些解类的K-T最优条件,本文研究这类解的几何特性,得到若干基本的必要条件一充分条件。 相似文献
3.
多目标线性规划的一种交互式单纯形算法 总被引:1,自引:0,他引:1
本文基于分析有效极点解的有效变量的特点以及在有效点处各个目标函数的数值来得到改进的搜索方向的研究思想,提出了求解目标函数和约束均为线性的多目标线性规划问题的一种交互式算法。该方法可以保证每一步得到的解均为有效极点解,且根据决策者的偏好不断得到改进,直至最终得到满意的最终解。 相似文献
4.
对于赋范线性空间中的多目标规划问题,引进了广义KT-真有效解的概念.在一定条件下,得到了广义KT-真有效解和广义H-局部真有效解之间的关系. 相似文献
5.
利用较多锥的内部和闭包,引进多目标规划问题的严格强较多有效解等概念.根据它们的表示定理,建立各类较多有效解的最优性条件,并由此得到严格弱较多有效解的Lagrange直接对偶和严格强较多有效解的Lagrange逆对偶定理. 相似文献
6.
将模糊集理论应用到多目标半定规划中来,提出了有约束的模糊多目标半定规划模型,并首次给出了其最优有效解的定义.通过构造确定的隶属度函数,将以矩阵为决策变量的模糊多目标半定规划转化为一种目标函数的某些分量由约束函数决定的确定性多目标半定规划,并证明了前者最优有效解与后者有效解的一致性.在此基础之上,讨论了二者的最优性条件. 相似文献
7.
8.
9.
傅丽仙 《数学的实践与认识》2005,35(11):16-22
以C2R模型为基础给出了一类多指标对象评价模型——C2RM模型.我们首先定义了决策单元的优势集,论证了C2RM模型比一类多目标规划模型在优化意义上更进一步——排除了此类多目标规划模型的一些优势集为空的Pareto有效解.我们建立的C2RM模型是线性规划模型,易于判定一个决策单元是否DEA有效.在优势集性质基础上我们进一步定义了C2RM模型下DEA有效决策单元的实际有效率,并给出了所有决策单元的一种排序,最后举例予以说明. 相似文献
10.
11.
This paper first applies the fuzzy set theory to multi-objective semi-definite program-ming (MSDP), and proposes the fuzzy multi-objective semi-definite programming (FMSDP) model whose optimal efficient solution is defined for the first time, too. By constructing a membership function, the FMSDP is translated to the MSDP. Then we prove that the optimal efficient solution of FMSDP is consistent with the efficient solution of MSDP and present the optimality condition about these programming. At last, we give an algorithm for FMSDP by introducing a new membership function and a series of transformation. 相似文献
12.
An interval approach based on expectation optimization for fuzzy random bilevel linear programming problems 总被引:1,自引:0,他引:1
This paper considers a class of bilevel linear programming problems in which the coefficients of both objective functions are fuzzy random variables. The main idea of this paper is to introduce the Pareto optimal solution in a multi-objective bilevel programming problem as a solution for a fuzzy random bilevel programming problem. To this end, a stochastic interval bilevel linear programming problem is first introduced in terms of α-cuts of fuzzy random variables. On the basis of an order relation of interval numbers and the expectation optimization model, the stochastic interval bilevel linear programming problem can be transformed into a multi-objective bilevel programming problem which is solved by means of weighted linear combination technique. In order to compare different optimal solutions depending on different cuts, two criterions are given to provide the preferable optimal solutions for the upper and lower level decision makers respectively. Finally, a production planning problem is given to demonstrate the feasibility of the proposed approach. 相似文献
13.
确定线性规划全部最优解的方法 总被引:5,自引:0,他引:5
使用凸多面体的表示定理 ,导出了标准型线性规划最优解的一般表达式 ,并基于单纯形法 ,给出最优解唯一性条件以及当唯一性条件不满足时求出全部最优解的计算步骤 ,同时附有数值例子 . 相似文献
14.
Farhad Hosseinzadeh Lotfi Abbas Ali Noora Gholam Reza Jahanshahloo Mohammad Khodabakhshi Ali Payan 《Applied Mathematical Modelling》2010
In a multi-objective linear fractional programming problem (MOLFPP), it is often useful to check the efficiency of a given feasible solution, and if the solution is efficient, it is useful to check strong or weak efficiency. In this paper, by applying a geometrical interpretation, a linear programming approach is achieved to test weak efficiency. Also, in order to test strong efficiency for a given weakly efficient point, a linear programming approach is constructed. 相似文献
15.
In multi-objective geometric programming problem there are more than one objective functions. There is no single optimal solution which simultaneously optimizes all the objective functions. Under these conditions the decision makers always search for the most “preferred” solution, in contrast to the optimal solution. A few mathematical programming methods namely fuzzy programming, goal programming and weighting methods have been applied in the recent past to find the compromise solution. In this paper ?-constraint method has been applied to find the non-inferior solution. A brief solution procedure of ?-constraint method has been presented to find the non-inferior solution of the multi-objective programming problems. Further, the multi-objective programming problems is solved by the fuzzy programming technique to find the optimal compromise solution. Finally, two numerical examples are solved by both the methods and compared with their obtained solutions. 相似文献
16.
E. Thanassoulis 《The Journal of the Operational Research Society》1985,36(2):155-161
In this note, an adaptation of PASEB is proposed which can solve multi-objective linear fractional programming problems. PASEB was originally proposed by the author for the solution of multi-objective linear programming problems. The proposed adaptation involves changes to certain computational aspects of PASEB to cope with the presence of fractional objectives in the problem. The changes can be expected to increase the computational requirements of the method and to slow down its speed of convergence, but they do not seriously affect its overall effectiveness. 相似文献
17.
The solution concept in multi-objective programming is represented by a program which reaches “the best compromise”. Many solving methods find a good compromise feasible solution and then check whether the solution is efficient or not. In this paper, using the efficiency test introduced by Lotfi et al. (2010) [12], we propose two procedures for deriving weakly and strongly efficient solutions in multi-objective linear fractional programming problems (MOLFPP) starting from any feasible solution, and present their possible applications in multiple criteria decision-making process. Then, we discuss a shortcoming of some fuzzy approaches to solving MOLFPP and modify them in order to guarantee the efficiency of the optimal solution. 相似文献
18.
Ghatee and Hashemi [M. Ghatee, S.M. Hashemi, Ranking function-based solutions of fully fuzzified minimal cost flow problem, Inform. Sci. 177 (2007) 4271–4294] transformed the fuzzy linear programming formulation of fully fuzzy minimal cost flow (FFMCF) problems into crisp linear programming formulation and used it to find the fuzzy optimal solution of balanced FFMCF problems. In this paper, it is pointed out that the method for transforming the fuzzy linear programming formulation into crisp linear programming formulation, used by Ghatee and Hashemi, is not appropriate and a new method is proposed to find the fuzzy optimal solution of multi-objective FFMCF problems. The proposed method can also be used to find the fuzzy optimal solution of single-objective FFMCF problems. To show the application of proposed method in real life problems an existing real life FFMCF problem is solved. 相似文献
19.
本文利用参数规划的逆问题考虑交叉规划与多目标规划的关系,把交叉规划转变为部分同变量规划组,再把部分同变量规划组转化为一个多目标规划,并说明了交叉规划的均衡解与多目标规划的最优解的关系. 相似文献