Abstract
The paper presents a finite branch-and-bound variant of an outcome-based algorithm proposed by Benson and Lee for minimizing a lower-semicontinuous function over the efficient set of a bicriteria linear programming problem. Similarly to the Benson-Lee algorithm, we work primarily in the outcome space. Dissimilarly, instead of constructing a sequence of consecutive efficient edges in the outcome space, we use the idea of generating a refining sequence of partitions covering the at most two-dimensional efficient set in the outcome space. Computational experience is also presented.
Similar content being viewed by others
References
Zeleny, M., Linear Multiobjective Programming, Springer, Berlin, Germany, 1974.
Zeleny, M., Multiple-Criteria Decision Making, McGraw-Hill, New York, NY, 1982.
YU, P. L., Multiple-Criteria Decision Making, Plenum, New York, NY, 1985.
Steuer, R. E., Multiple-Criteria Optimization: Theory, Computation, and Application, John Wiley and Sons, New York, NY, 1985.
Shin, W. S., and Ravindran, A., Interactive Multiple-Objective Optimization: Survey, Part 1: Continuous Case, Computers and Operations Research, Vol. 18, pp. 97–114, 1991.
Dauer, J. P., Analysis of the Objective Space in Multiple-Objective Linear Programming, Journal of Mathematical Analysis and Applications, Vol. 126, pp. 579–593, 1987.
Dauer, J. P., On Degeneracy and Collapsing in the Construction of the Set of Objective Values in a Multiple-Objective Linear Program, Annals of Operations Research, Vol. 47, pp. 279–292, 1993.
Dauer, J. P., and Liu, Y. H., Solving Multiple-Objective Linear Programs in Objective Space, European Journal of Operational Research, Vol. 46, pp. 350–357, 1990.
Dauer, J. P., and Saleh, O. A., Constructing the Set of Efficient Outcome Values in Multiple-Objective Linear Programs, European Journal of Operational Research, Vol. 46, pp. 358–365, 1990.
Benson, H. P., A Geometrical Analysis of the Efficient Outcome Set in Multiple-Objective Convex Programs with Linear Criterion Functions, Journal of Global Optimization, Vol. 6, pp. 231–251, 1995.
Gallagher, R. J., and Saleh, O. A., A Representation of an Efficiency Equivalent Polyhedron for the Objective Set of a Multiple-Objective Linear Program, European Journal of Operational Research, Vol. 80, pp. 204–212, 1995.
Dauer, J. P., and Gallagher, R. J., A Combined Constraint-Space, Objective-Space Approach for Determining High-Dimensional Maximal Efficient Faces of Multiple-Objective Linear Programs, European Journal of Operational Research, Vol. 88, pp. 368–381, 1996.
Benson, H. P., An Outer-Approximation Algorithm for Generating All Efficient Extreme Points in the Outcome Set of a Multiple-Objective Linear Programming Problem, Journal of Global Optimization, Vol. 13, pp. 1–24, 1998.
Benson, H. P., Hybrid Approach for Solving Multiple-Objective Linear Programs in Outcome Space, Journal of Optimization Theory and Applications, Vol. 98, pp. 17–35, 1998.
Geoffrion, A. M., Solving Bicriterion Mathematical Programs, Operations Research, Vol. 15, pp. 39–54, 1967.
Gearhart, W. B., On the Characterization of Pareto-Optimal Solutions in Bicriteria Optimization, Journal of Optimization Theory and Applications, Vol. 27, pp. 301–307, 1979.
Benson, H. P., Vector Maximization with Two Objective Functions, Journal of Optimization Theory and Applications, Vol. 28, pp. 253–257, 1979.
Kiziltan, G., and Yucaoglu, E., An Algorithm for Bicriterion Linear Programming, European Journal of Operational Research, Vol. 10, pp. 406–411, 1982.
Aneja, Y. P., and Nair, K. P. K., Bicriteria Transportation Problems, Management Science, Vol. 25, pp. 73–78, 1979.
Cohon, J. L., Church, R. L., and Sheer, D. P., Generating Multiobjective Tradeoffs: An Algorithm for Bicriterion Problems, Water Resources Research, Vol. 25, pp. 73–78, 1979.
Solanski, R. S., and Cohon, J. L., Approximating the Noninferior Set in Linear Biobjective Programs Using Multiparametric Decomposition, European Journal of Operational Research, Vol. 41, pp. 355–366, 1989.
Benson, H. P., Generating the Efficient Outcome Set in Multiple-Objective Linear Programs: The Bicriteria Case, Acta Mathematica Vietnamica, Vol. 22, pp. 29–52, 1997.
Walker, J., An Interactive Method as an Aid in Solving Bicriterion Mathematical Programming Problems, Journal of the Operational Research Society, Vol. 29, pp. 915–922, 1978.
Klein, G., Moskowitz, H., and Ravindran, A., Comparative Evaluation of Prior versus Progressive Articulation of Preferences in Bicriterion Optimization, Naval Research Logistics, Vol. 33, pp. 309–323, 1986.
Shin, W. S., and Lee, J. J., A Multirun Interactive Method for Bicriterion Optimization Problems, Naval Research Logistics, Vol. 39, pp. 115–135, 1992.
Philip, J., Algorithms for the Vector Maximization Problem, Mathematical Programming, Vol. 2, pp. 207–229, 1972.
Benson, H. P., Optimization over the Efficient Set, Journal of Mathematical Analysis and Applications, Vol. 98, pp. 562–580, 1984.
Benson, H. P., An All-Linear Programming Relaxation Algorithm for Optimization over the Efficient Set, Journal of Global Optimization, Vol. 1, pp. 83–104, 1991.
Dauer, J. P., Optimization over the Efficient Set Using an Active Constraint Approach, Zeitschrift fü r Operations Research, Vol. 35, pp. 185–195, 1991.
Benson, H. P., A Finite, Nonadjacent Extreme Point Search Algorithm for Optimization over the Efficient Set, Journal of Optimization Theory and Applications, Vol. 73, pp. 47–64, 1992.
Muu, L. D., A Method for Optimizing a Linear Function over the Efficient Set, Working Paper, Institute of Mathematics, Hanoi, Vietnam, 1992.
Benson, H. P., A Bisection Extreme-Point Search Algorithm for Optimization over the Efficient Set in the Linear Dependent Case, Journal of Global Optimization, Vol. 3, pp. 95–101, 1993.
Benson, H. P., and Sayin, S., A Face Search Heuristic for Optimization over the Efficient Set, Naval Research Logistics, Vol. 40, pp. 103–116, 1993.
Bolintineanu, S., Minimization of a Quasiconcave Function over an Efficient Set, Mathematical Programming, Vol. 61, pp. 89–110, 1993.
Benson, H. P., and Sayin, S., Optimization over the Efficient Set: Four Special Cases, Journal of Optimization Theory and Applications, Vol. 80, pp. 3–18, 1994.
Ecker, J. G., and Song, J. H., Optimizing a Linear Function over an Efficient Set, Journal of Optimization Theory and Applications, Vol. 83, pp. 541–563, 1994.
FÜ lÖ p, J., A Cutting Plane Method for Linear Optimization over the Efficient Set, Generalized Convexity, Edited by S. Komló si, T. Rapcsák, and S. Schaible, Springer Verlag, Berlin, Germany, pp. 378–385, 1994.
Dauer, J. P., and Fosnaugh, T. A., Optimization over the Efficient Set, Journal of Global Optimization, Vol. 7, pp. 261–271, 1995.
FÜ lÖ p, J., Lagrangian Duality of Concave Minimization Subject to Linear Constraints and an Additional Facial Reverse Convex Constraint, Journal of Optimization Theory and Applications, Vol. 91, pp. 617–641, 1996.
White, D. J., The Maximization of a Function over the Efficient Set via a Penalty Function Approach, European Journal of Operational Research, Vol. 94, pp. 143–153, 1996.
Muu, L. D., Computational Aspects of Optimization Problems over the Efficient Set, Vietnam Journal of Mathematics, Vol. 23, pp. 85–106, 1995.
Muu, L. D., and Luc, L. T., On Convex Maximization Formulations and Decomposable Property of Optimization over the Efficient Set, Preprint, Institute of Mathematics, Hanoi, Vietnam, 1995.
An, L. T. H., Tao, P. D., and Muu, L. D., Numerical Solution for Optimization over the Efficient Set by D.C. Optimization Algorithms, Operations Research Letters, Vol. 19, pp. 117–128, 1996.
Muu, L. D., and Luc, L. T., On Equivalence between Convex Maximization and Optimization over the Efficient Set, Vietnam Journal of Mathematics, Vol. 24, pp. 439–444, 1996.
Thach, P. T., Konno, H., and Yokota, D., Dual Approach to Minimization on the Set of Pareto-Optimal Solutions, Journal of Optimization Theory and Applications, Vol. 88, pp. 689–707, 1996.
Luc, L. T., and Muu, L. D., Global Optimization Approach to Optimizing over the Efficient Set, Recent Advances in Optimization, Edited by P. Gritzmann, R. Horst, E. Sachs, and R. Tichatschke, Springer Verlag, Berlin, Germany, pp. 183–195, 1997.
Horst, R., and Thoai, N. V., Utility Function Programs and Optimization over the Efficient Set in Multiple-Objective Decision Making, Journal of Optimization Theory and Applications, Vol. 92, pp. 605–631, 1997.
Benson, H. P., and Lee, D., Outcome-Based Algorithm for Optimizing over the Efficient Set of a Bicriteria Linear Programming Problem, Journal of Optimization Theory and Applications, Vol. 88, pp. 77–105, 1996.
Dan, N. D. N., and Muu, L. D., A Parametric Simplex Method for Optimizing over the Efficient Set of a Bicriteria Linear Problem, Acta Mathematica Vietnamica, Vol. 21, pp. 59–67, 1996.
FÜ lÖ p, J., On the Equivalency between a Linear Bilevel Programming Problem and Linear Optimization over the Efficient Set, Working Paper 93–1, Laboratory of Operations Research and Decision Systems, Computer and Automation Institute, Hungarian Academy of Sciences, 1993.
Shin, W. S., and Allen, D. B., An Interactive Paired Comparison Method for Bicriterion Integer Programming, Naval Research Logistics, Vol. 41, pp. 423–434, 1994.
Benson, H. P., Complete Efficiency and the Initialization of Algorithms for Multiple-Objective Programming, Operations Research Letters, Vol. 10, pp. 481–487, 1991.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Fülöp, J., Muu, L.D. Branch-and-Bound Variant of an Outcome-Based Algorithm for Optimizing over the Efficient Set of a Bicriteria Linear Programming Problem. Journal of Optimization Theory and Applications 105, 37–54 (2000). https://doi.org/10.1023/A:1004657827134
Issue Date:
DOI: https://doi.org/10.1023/A:1004657827134