We introduce in this paper a new multiple-objective linear programming (MOLP) algorithm. The algorithm is based on the single-objective path-following primal-dual linear programming algorithm and combines it with aspiration levels and the use of achievement scalarizing functions. The resulting algor
Using aspiration levels in an interactive interior multiobjective linear programming algorithm
β Scribed by Ami Abel; Pekka Korhonen
- Book ID
- 108445310
- Publisher
- Elsevier Science
- Year
- 1996
- Tongue
- English
- Weight
- 823 KB
- Volume
- 89
- Category
- Article
- ISSN
- 0377-2217
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
We present a new interactive multiobjective linear programming algorithm that is based on one variant of Karmarkar's algorithm known as the path-following primal-dual algorithm. The modification of this single-objective linear programming algorithm to the multiobjective case is done by deriving an a
## Abstract Two major approaches to deal with randomness or ambiguity involved in mathematical programming problems have been developed. They are stochastic programming approaches and fuzzy programming approaches. In this paper, we focus on multiobjective linear programming problems with random var
The multiobjective 0-1 programming problem with fuzzy numbers is a formalization designed to represent expert judgment. Using the non-fuzzy a-multiobjective programming problem, in which the membership degrees of components of the coefficient vector are set in accordance with the decision makers obj