J4

• 数学 • 上一篇    下一篇

求解线性多目标规划的一种新方法

王彩玲, 李忠范, 刘庆怀   

  1. 吉林大学数学学院, 长春 130012
  • 收稿日期:2004-09-13 修回日期:1900-01-01 出版日期:2005-05-26 发布日期:2005-05-26
  • 通讯作者: 刘庆怀

A New Method for Solving Linear Multiobjective Programming

WANG Cai-ling, LI Zhong-fan, LIU Qing-huai   

  1. College of Mathematics, Jilin University, Changchun 130012, China
  • Received:2004-09-13 Revised:1900-01-01 Online:2005-05-26 Published:2005-05-26
  • Contact: LIU Qing-huai

摘要: 给出求解线性多目标规划问题弱有效解子集的一种新算 法. 在不同的条件下, 运用此算法得到了线性多目标规划的弱有效解子集, 并在得到的解子 集中再次进行寻优, 进而得到弱有效解集中决策者满意的较优解; 同时用VC++语言实现 了此算法, 并给出了具体算例.

关键词: 多目标规划, 弱有效解, 算法

Abstract: The present paper presented a new algorithm for solving the subset of the weakly efficient solution of linear multiobjective programming (LVP). The su bset of the weakly efficient solution of (LVP) was obtained under different cond itions, and the be tter solution of the subset of the weakly efficient solution was achieved agai n. The algorithm was practised together with concert examples and VC++ computer language.

Key words: multiobjective programming, weakly efficient solution, algorithm

中图分类号: 

  • O221