A bookkeeping strategy for multiple objective linear programs
DOI10.1016/S0305-0548(97)00016-6zbMATH Open0889.90121OpenAlexW2092257798MaRDI QIDQ1374030FDOQ1374030
Authors: Alok Aurovillian, Hong Zhang, Malgorzata M. Wiecek 
Publication date: 22 June 1998
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0305-0548(97)00016-6
Recommendations
- A parallel algorithm for multiple objective linear programs
- Publication:4945552
- Computational efficiency and interactive MOLP algorithms: An implementation of the SIMOLP procedure
- On the modified interior point algorithm for solving multi-objective linear programming problems
- Computer-based algorithms for multiple criteria and multiple constraint level integer linear programming
Parallel numerical computation (65Y05) Linear programming (90C05) Large-scale problems in mathematical programming (90C06) Multi-objective and goal programming (90C29)
Cites Work
- Title not available (Why is that?)
- Finding all efficient extreme points for multiple objective linear programs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Linear multiobjective programming
- Title not available (Why is that?)
- Determination of the efficient set in multiobjective linear programming
- A simplified MOLP algorithm: The MOLP-S procedure
- Random problem genertion and the computation of efficient extreme points in multiple objective linear programming
- A parallel algorithm for multiple objective linear programs
- Title not available (Why is that?)
- Title not available (Why is that?)
Uses Software
This page was built for publication: A bookkeeping strategy for multiple objective linear programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1374030)
