An interior method for multiobjective linear programs
碩士 === 國立清華大學 === 數學系 === 85 === Arbel and Oren present the first interion-point multiobjective linear programming(MOLP) algorithms, whichare based on the interior-point algorithms for solvingthe usual (single- objective) linear programs....
Main Authors: | Jenq, Jiann-Pyng, 鄭建平 |
---|---|
Other Authors: | Eugene K. Yang |
Format: | Others |
Language: | zh-TW |
Published: |
1997
|
Online Access: | http://ndltd.ncl.edu.tw/handle/89035829602309477125 |
Similar Items
-
An Interior Algorithm For Solving Multiobjective Linear Programming Problems
by: Cheng, Ren-Woei, et al.
Published: (1997) -
An interior potential push algorithm for solving multiobjective linear programming problems
by: Min-Dien Huang, et al.
Published: (2005) -
Homotopy Interior-Point Method for a General Multiobjective Programming Problem
by: X. Zhao, et al.
Published: (2012-01-01) -
The essential multiobjectivity of linear programming
by: TJ Stewart
Published: (2007-06-01) -
On interior point methods for linear programming
by: Cartis, Coralia
Published: (2005)