Piecewise lexicographic programming: A new model for practical decision problems
From MaRDI portal
Publication:1321139
DOI10.1007/BF00939952zbMath0793.90067MaRDI QIDQ1321139
Walter Ukovich, Amedeo Premoli
Publication date: 27 April 1994
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Related Items (2)
Application of convex lexicographical optimization to the balance of GRTgaz gas grid ⋮ An algorithm for linearly-constrained piecewise lexicographic programming problems.
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A survey of vector optimization in infinite-dimensional spaces. II
- Multiobjective mathematical programming via the MULTIPLEX model and algorithm
- Multiple-criteria decision making. Concepts, techniques, and extensions. With the assistance of Yoon-Ro Lee and Antonie Stam
- A survey of multicriteria optimization or the vector maximum problem. I: 1776-1960
- Linear Programming with Special Ordered Sets
- Relationships among linear formulations of separable convex piecewise linear programs
- A simplex algorithm for piecewise-linear programming I: Derivation and proof
- A Process for Determining Priorities and Weights for Large-Scale Linear Goal Programmes
- Piecewise-linear programming: The compact (CPLP) algorithm
This page was built for publication: Piecewise lexicographic programming: A new model for practical decision problems