期刊文献+

多目标线性规划的交互式线性加权内点算法 被引量:4

An interactive interior algorithm for multiobjective linear programming based on weighting utility function
下载PDF
导出
摘要 将内点算法应用于多目标规划的交互方法中 ,提出一种基于线性加权评价函数的解决多目标线性规划问题的新算法。在利用内点算法进行迭代计算的过程中 ,不断根据决策者的当前偏好信息随时修正权重系数 。 we implement the interior point algorithm into the interactive method to solve MOLP problems. The utility function is taken as weighted sum of the objective functions, whose coefficients depend on the DM’s reference and is updated successively. The decision maker will be asked to provide the locally relevant preference information when the iteration is still on the process rather than the optimal solution has been calculated with the current coefficient. Thus the weighting vector can be updated and the interior path can be adjusted in time. So the computational efficiency would be largely improved.
出处 《贵州大学学报(自然科学版)》 2004年第1期30-35,共6页 Journal of Guizhou University:Natural Sciences
关键词 多目标线性规划 内点算法 交互方法 Multiobjective linear programming Interior point algorithm Interactive method
  • 相关文献

参考文献12

  • 1方述诚 S普森普拉.线性优化及扩展理论与算法[M].北京:科学出版社,1994..
  • 2D den Hertog, Interior Point Approach to Linear[ M ]. Quadratic and Convex Programming Algorithms and Complexity, 1999.
  • 3Ami Abel, Pekka Korhonen. Using aspiration levels in an interactive interior multiobjective linear programming algorithm. [ J ]. European Journal of Operational Research, 1996,89 : 193 - 201.
  • 4Ami Arbel, Shmuel S. Oren, Using approximate gradients in developing an interactive interior primal - dual multiobjective linear programming algorithm [ J ]. European Journal of Operational Research, 1996,89 : 201 - 211.
  • 5Theodore B Trafalis, Rashid M Alkahtani. An interactive analytic center trade-off cutting plane algorithm for multiobjective linear programming[ J ]. Computers & Industrial Engineering, 1999,37:649- 669.
  • 6Karmarkar N K. A new polynomial time algorithm for linear programming[ J]. Combinatorica, Combinatorica, 1984,4:373 -395.
  • 7方述诚 S普森普拉.线性优化及扩展理论与算法[M].科学出版社,1994..
  • 8Karmarkar N K.A new polynomial time algorithm for linear programming[J].Combinatorica,Combinatorica,1984,4:373-395.
  • 9D.den Hertog,Interior Point Approach to Linear[M].Quadratic and Convex Programming Algorithms and Complexity,1999.
  • 10Ami Abel,Pekka Korhonen.Using aspiration levels in an interactive interior multiobjective linear programming algorithm.[J]European Joumal of Operational Research,1996,89:193-201.

共引文献12

同被引文献56

引证文献4

二级引证文献56

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部