Approximating the noninferior set in linear biobjective programs using multiparametric decomposition
From MaRDI portal
Publication:1823867
DOI10.1016/0377-2217(89)90256-7zbMath0681.90071MaRDI QIDQ1823867
Jared L. Cohon, Rajendra S. Solanki
Publication date: 1989
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(89)90256-7
approximate representation; linear biobjective optimization; multiparametric decomposition; noninferior set
65K05: Numerical mathematical programming methods
90C31: Sensitivity, stability, parametric optimization
Related Items
Approximating the noninferior set in multiobjective linear programming problems, An improved multiple criteria visual interactive method with stepwise focused contouring of efficient criterion vectors, Branch-and-bound variant of an outcome-based algorithm for optimizing over the efficient set of a bicriteria linear programming problem, Approximation methods in multiobjective programming
Cites Work
- Unnamed Item
- Multiobjective programming and planning
- The set of all nondominated solutions in linear cases and a multicriteria simplex method
- Linear multiobjective programming
- Generating all maximal efficient faces for multiple objective linear programs
- Proper efficiency and the theory of vector maximization
- Multiple Objective Linear Programming with Interval Criterion Weights
- Linear Multiparametric Programming by Multicriteria Simplex Method
- Vektormaximumproblem und parametrische optimierung
- A revised simplex method for linear multiple objective programs
- Algorithms for the vector maximization problem
- Technical Note—Proper Efficiency and the Linear Vector Maximum Problem
- Multiparametric Linear Programming