Piecewise lexicographic programming: A new model for practical decision problems
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3175708 (Why is no real title available?)
- scientific article; zbMATH DE number 3945836 (Why is no real title available?)
- scientific article; zbMATH DE number 3961334 (Why is no real title available?)
- scientific article; zbMATH DE number 3177183 (Why is no real title available?)
- A Process for Determining Priorities and Weights for Large-Scale Linear Goal Programmes
- A simplex algorithm for piecewise-linear programming I: Derivation and proof
- A survey of multicriteria optimization or the vector maximum problem. I: 1776-1960
- A survey of vector optimization in infinite-dimensional spaces. II
- Linear Programming with Special Ordered Sets
- 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
- Piecewise-linear programming: The compact (CPLP) algorithm
- Relationships among linear formulations of separable convex piecewise linear programs
Cited in
(2)
This page was built for publication: Piecewise lexicographic programming: A new model for practical decision problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1321139)