双目标规划问题的像集与求解
    点此下载全文
引用本文:马赞甫1, 刘妍珺2.双目标规划问题的像集与求解[J].经济数学,2016,(2):75-79
摘要点击次数: 552
全文下载次数: 20
作者单位
马赞甫1, 刘妍珺2 (1. 贵州财经大学 贵州省经济系统仿真重点实验室贵州 贵阳 5500252. 贵州财经大学 数学与统计学院贵州 贵阳 550025) 
中文摘要:经济管理的决策目标往往与成本、收益相关,双目标规划在经济管理中具有广泛应用.然而,尚缺乏成熟的算法确定双目标规划问题的全部解.给出双目标规划问题像集的一般性确定法,以求其解,为研究目的所在.具体而言,构造一个带等式约束的单目标规划问题,以确定双目标规划问题像集之部分边界,并借助拉格朗日乘子符号判断其单调性,据此确定原问题的帕累托解与弱帕累托解.这相当于提供了一个求解双目标规划问题的一般性框架.
中文关键词:最优化  双目标规划解法  单目标规划  像集  弱帕累托解
 
The Image Set for Solving Double Objective Optimization Problems
Abstract:The objective of decision-making in economic management is often related to cost and benefit. A good case in point is that bi-objective programming based on cost-benefit analysis is widely used in economic management. However, so far, there is still a lack of mature algorithms to determine the full solution of the Bi -objective programming problem. A general method, which was used to get the Pareto solution or weak Pareto solution for double objective optimization problems, was put forward in this research. To be specific, we constructed a single objective programming with equality constrain to determine the frontier of the image set of double objective optimization problems. Furthermore, we could determine the frontier's functional monotonicity using Lagrange multiplier and finally get the Pareto solution or weak Pareto solution. Base on above steps, A general framework was presented to solve double objective programming problem.
keywords:Optimization, The Method of Solving Double-Objective Programming, Single-Objective Programming, Image Set, Weak Pareto Solution
查看全文   查看/发表评论   下载pdf阅读器