共查询到19条相似文献,搜索用时 140 毫秒
1.
2.
3.
4.
利用广义投影矩阵,对求解无约束规划的三项记忆梯度算法中的参数给一条件,确定它们的取值范围,以保证得到目标函数的三项记忆梯度广义投影下降方向,建立了求解非线性等式和不等式约束优化问题的三项记忆梯度广义投影算法,并证明了算法的收敛性.同时给出了结合FR,PR,HS共轭梯度参数的三项记忆梯度广义投影算法,从而将经典的共轭梯度算法推广用于求解约束规划问题.数值例子表明算法是有效的. 相似文献
5.
《数学的实践与认识》2013,(19)
针对于多目标0-1规划问题,给出一种新型的智能优化算法-萤火虫优化算法对其进行求解,并在计算机上予以实现.经一系列算例测试,并与其它智能算法进行比较,算法能获得较多的非劣解,表明算法可行有效,可求解实际应用中的相应问题. 相似文献
6.
本文讨论不动点算法在非光滑多目标规划中的应用,得到了一些新的最优性条件以及不动点与非光滑多目标的解之间的关系,并且给出了解非光滑多目标规划的不动点算法的收敛性。 相似文献
7.
8.
9.
多目标最优化的一种积分型实现算法 总被引:2,自引:1,他引:1
在文[1]中给出了求解多目标最优化的一种积分总极值的概念性算法.本文利用数论中的一致分布佳点集列,较为简便的得出了多目标最优化的积分总极值的实现算法和算法终止准则.并经过有关函数数值计算表明该算法是有效的,可用来求解多目标最优化问题的有效解. 相似文献
10.
本文利用广义投影矩阵,对求解无约束规划的超记忆梯度算法中的参数给出一种新的取值范围以保证得到目标函数的超记忆梯度广义投影下降方向,并与处理任意初始点的方法技巧结合建立求解非线性不等式约束优化问题的一个初始点任意的超记忆梯度广义投影算法,在较弱条件下证明了算法的收敛性.同时给出结合FR,PR,HS共轭梯度参数的超记忆梯度广义投影算法,从而将经典的共轭梯度法推广用于求解约束规划问题.数值例子表明算法是有效的. 相似文献
11.
黄时祥 《数学的实践与认识》2007,37(5):83-88
利用极大熵方法将带多个非线性不等式约束和多个非线性等式约束的多目标规划问题变为两个非线性不等式约束的单个可微的目标函数优化问题,并结合区间分析知识给出一种新的解决多目标规划问题的区间方法. 相似文献
12.
不确定信息多目标线性优化的鲁棒方法 总被引:1,自引:0,他引:1
研究不确定信息的多目标线性优化问题,其数据不能精确给出但是属于一个给定的集合.首先,采用鲁棒方法把该问题转化为一个确定的多目标优化问题.然后,给出此问题解存在的充分条件.最后,通过实例验证了用鲁棒方法解决不确定信息的多目标线性优化问题的有效性. 相似文献
13.
《European Journal of Operational Research》2001,129(2):386-413
In this paper we consider a production model in which multiple decision makers pool resources to produce finished goods. Such a production model, which is assumed to be linear, can be formulated as a multiobjective linear programming problem. It is shown that a multi-commodity game arises from the multiobjective linear production programming problem with multiple decision makers and such a game is referred to as a multiobjective linear production programming game. The characteristic sets in the game can be obtained by finding the set of all the Pareto extreme points of the multiobjective programming problem. It is proven that the core of the game is not empty, and points in the core are computed by using the duality theory of multiobjective linear programming problems. Moreover, the least core and the nucleolus of the game are examined. Finally, we consider a situation that decision makers first optimize their multiobjective linear production programming problem and then they examine allocation of profits and/or costs. Computational methods are developed and illustrative numerical examples are given. 相似文献
14.
Several fuzzy approaches can be considered for solving multiobjective transportation problem. This paper presents a fuzzy goal programming approach to determine an optimal compromise solution for the multiobjective transportation problem. We assume that each objective function has a fuzzy goal. Also we assign a special type of nonlinear (hyperbolic) membership function to each objective function to describe each fuzzy goal. The approach focuses on minimizing the negative deviation variables from 1 to obtain a compromise solution of the multiobjective transportation problem. We show that the proposed method and the fuzzy programming method are equivalent. In addition, the proposed approach can be applied to solve other multiobjective mathematical programming problems. A numerical example is given to illustrate the efficiency of the proposed approach. 相似文献
15.
The aim of this paper is to deal with a multiobjective linear programming problem with fuzzy random coefficients. Some crisp equivalent models are presented and a traditional algorithm based on an interactive fuzzy satisfying method is proposed to obtain the decision maker’s satisfying solution. In addition, the technique of fuzzy random simulation is adopted to handle general fuzzy random objective functions and fuzzy random constraints which are usually hard to be converted into their crisp equivalents. Furthermore, combined with the techniques of fuzzy random simulation, a genetic algorithm using the compromise approach is designed for solving a fuzzy random multiobjective programming problem. Finally, illustrative examples are given in order to show the application of the proposed models and algorithms. 相似文献
16.
《European Journal of Operational Research》1999,117(1):175-182
In conventional multiobjective decision making problems, the estimation of the parameters of the model is often a problematic task. Normally they are either given by the decision maker (DM), who has imprecise information and/or expresses his considerations subjectively, or by statistical inference from past data and their stability is doubtful. Therefore, it is reasonable to construct a model reflecting imprecise data or ambiguity in terms of fuzzy sets for which a lot of fuzzy approaches to multiobjective programming have been developed. In this paper we propose a method to solve a multiobjective linear programming problem involving fuzzy parameters (FP-MOLP), whose possibility distributions are given by fuzzy numbers, estimated from the information provided by the DM. As the parameters, intervening in the model, are fuzzy the solutions will be also fuzzy. We propose a new Pareto Optimal Solution concept for fuzzy multiobjective programming problems. It is based on the extension principle and the joint possibility distribution of the fuzzy parameters of the problem. The method relies on α-cuts of the fuzzy solution to generate its possibility distributions. These ideas are illustrated with a numerical example. 相似文献
17.
In this paper, optimality conditions for multiobjective programming problems havingF-convex objective and constraint functions are considered. An equivalent multiobjective programming problem is constructed by a modification of the objective function. Furthermore, anF—Lagrange function is introduced for a constructed multiobjective programming problem, and a new type of saddle point is introduced. Some results for the new type of a saddle point are given. 相似文献
18.
In this paper, we are concerned with a differentiable multiobjective programming problem in topological vector spaces. An alternative theorem for generalized K subconvexlike mappings is given. This permits the establishment of optimality conditions in this context: several generalized Fritz John conditions, in line to those in Hu and Ling [Y. Hu, C. Ling, The generalized optimality conditions of multiobjective programming problem in topological vector space, J. Math. Anal. Appl. 290 (2004) 363-372] are obtained and, in the presence of the generalized Slater's constraint qualification, the Karush-Kuhn-Tucker necessary optimality conditions. 相似文献
19.
对于群体多目标决策问题,决策者可以各自的关于目标之间的权衡比表达其偏爱信息并进行决策.当个体权衡比具有加性性质时可得群体权衡比.本文以此构造一种求解群体非线性规划问题的交互算法.迭代中基于求解决非线性规划的Topkis-Veinott方法构造可行方向.在一定的条件下,算法收敛于所讨论问题的群体满意解. 相似文献