Efficiency and Optimality in Minisum, Minimax 0-1 Programming Problems
- 1 February 1982
- journal article
- Published by Taylor & Francis in Journal of the Operational Research Society
- Vol. 33 (2) , 137-151
- https://doi.org/10.1057/jors.1982.26
Abstract
Inspired by an increasing interest in multicriteria 0-1 programming problems in general and by a recent result on the reducibility of minimax to minisum problems in particular, we consider properties of efficient and optimal solutions to two-criteria (minisum and minimax) 0-1 programming problems with any constraint set. A solution procedure is suggested for solving problems whose objective functions are a convex combination of these criteria. The solution properties are illustrated with examples mainly within the context of locational decision problems.Keywords
This publication has 0 references indexed in Scilit: