Skip to main content
SpringerLink
Log in

An Outer Approximation Algorithm for Generating All Efficient Extreme Points in the Outcome Set of a Multiple Objective Linear Programming Problem

  • Published:
Journal of Global Optimization Aims and scope Submit manuscript

Abstract

Various difficulties have been encountered in using decision set-based vector maximization methods to solve a multiple objective linear programming problem (MOLP). Motivated by these difficulties, some researchers in recent years have suggested that outcome set-based approaches should instead be developed and used to solve problem (MOLP). In this article, we present a finite algorithm, called the Outer Approximation Algorithm, for generating the set of all efficient extreme points in the outcome set of problem (MOLP). To our knowledge, the Outer Approximation Algorithm is the first algorithm capable of generating this set. As a by-product, the algorithm also generates the weakly efficient outcome set of problem (MOLP). Because it works in the outcome set rather than in the decision set of problem (MOLP), the Outer Approximation Algorithm has several advantages over decision set-based algorithms. It is also relatively easy to implement. Preliminary computational results for a set of randomly-generated problems are reported. These results tangibly demonstrate the usefulness of using the outcome set approach of the Outer Approximation Algorithm instead of a decision set-based approach.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Cohon, J. L. (1978), Multiobjective Programming and Planning, Academic Press, New York.

    Google Scholar 

  2. Evans, G. W. (1984), An Overview of Techniques for Solving Multiobjective Mathematical Programs, Management Science 30, 1268–1282.

    Google Scholar 

  3. Goicoechea, A., Hansen, D. R. and Duckstein, L. (1982), Multiobjective Decision Analysis with Engineering and Business Applications, John Wiley and Sons, New York.

    Google Scholar 

  4. Luc, D. T. (1989), Theory of Vector Optimization, Springer Verlag, Berlin/New York.

    Google Scholar 

  5. Sawaragi, Y., Nakayama, H. and Tanino, T. (1985), Theory of Multiobjective Optimization, Academic Press, Orlando, Florida.

    Google Scholar 

  6. Steuer, R. E. (1986), Multiple Criteria Optimization: Theory, Computation, and Application, John Wiley and Sons, New York.

    Google Scholar 

  7. Yu, P. L. (1985), Multiple Criteria Decision Making, Plenum, New York.

    Google Scholar 

  8. Zeleny, M. (1982), Multiple Criteria Decision Making, McGraw-Hill, New York.

    Google Scholar 

  9. Kuhn, H. W. and Tucker, A. W. (1950), Nonlinear Programming, in J. Neyman (ed.), Proceedings of the 2nd Berkeley Symposium on Mathematical Statistics and Probability, University of California Press, Berkeley, California, pp. 481–492.

    Google Scholar 

  10. Geoffrion, A. M. (1968), Proper Efficiency and the Theory of Vector Maximization, Journal of Mathematical Analysis and Applications 22, 618–630.

    Article  Google Scholar 

  11. Philip, J. (1972), Algorithms for the Vector Maximization Problem, Mathematical Programming 2, 207–229.

    Article  Google Scholar 

  12. Evans, J. P. and Steuer, R. E. (1973), Generating Efficient Extreme Points in Linear Multiple Objective Programming: Two Algorithms and Computing Experience, in J. L. Cochrane and M. Zeleny (eds.), Multiple-Criteria Decision Making, University of South Carolina Press, Columbia, South Carolina, pp. 349–365.

    Google Scholar 

  13. Yu, P. L. and Zeleny, M. (1975), The Set of All Nondominated Solutions in Linear Cases and a Multicriteria Simplex Method, Journal of Mathematical Analysis and Applications 49, 430–468.

    Article  Google Scholar 

  14. Benson, H. P. (1979), Vector Maximization with Two Objective Functions, Journal of Optimization Theory and Applications 28, 253–257.

    Article  Google Scholar 

  15. Isermann, H. (1977), The Enumeration of the Set of All Efficient Solutions for a Linear Multiple Objective Program, Operational Research Quarterly 28, 711–725.

    Google Scholar 

  16. Bitran, G. R. (1979), Theory and Algorithms for Linear Multiple Objective Programs with Zero-One Variables, Mathematical Programming 17, 362–390.

    Article  Google Scholar 

  17. Villarreal, B. and Karwan, M. H. (1981), Multicriteria Integer Programming: A (Hybrid) Dynamic Programming Recursive Approach, Mathematical Programming 21, 204–223.

    Article  Google Scholar 

  18. Kostreva, M. M. and Wiecek, M. M. (1993), Time Dependency in Multiple Objective Dynamic Programming, Journal of Mathematical Analysis and Applications 173, 289–307.

    Article  Google Scholar 

  19. Marcotte, O. and Soland, R. M. (1986), An Interactive Branch-and-Bound Algorithm for Multiple Criteria Optimization, Management Science 32, 61–75.

    Google Scholar 

  20. Steuer, R. E. (1976), A Five-Phase Procedure for Implementing a Vector-Maximum Algorithm for Multiple Objective Linear Programming Problems, in H. Thiriez and S. Zionts (eds.), Multiple-Criteria Decision Making: Jouy-en-Josas, France, Springer Verlag, Berlin/New York.

    Google Scholar 

  21. Benson, H. P. (1997), Generating the Efficient Outcome Set in Multiple Objective Linear Programs: The Bicriteria Case, Acta Mathematica Vietnamica 22, 29–51.

    Google Scholar 

  22. Sayin, S. (1996), An Algorithm Based on Facial Decomposition for Finding the Efficient Set in Multiple Objective Linear Programming, Operations Research Letters 19, 87–94.

    Article  Google Scholar 

  23. Armand, P. (1993), Finding All Maximal Efficient Faces in Multiobjective Linear Programming, Mathematical Programming 61, 357–375.

    Article  Google Scholar 

  24. Armand, P. and Malivert, C. (1991), Determination of the Efficient Decision Set in Multiobjective Linear Programming, Journal of Optimization Theory and Applications 70, 467–489.

    Article  Google Scholar 

  25. Benson, H. P. (1981), Finding an Initial Efficient Extreme Point for a Linear Multiple Objective Program, The Journal of the Operational Research Society 32, 495–498.

    Article  Google Scholar 

  26. Benson, H. P. (1985), Multiple Objective Linear Programming with Parametric Criteria Coefficients, Management Science 31, 461–474.

    Google Scholar 

  27. Benson, H. P. and Aksoy, Y. (1991), Using Efficient Feasible Directions in Interactive Multiple Objective Linear Programming, Operations Research Letters 10, 203–209.

    Article  Google Scholar 

  28. Ecker, J. G. and Kouada, I. A. (1978), Finding All Efficient Extreme Points for Multiple Objective Linear Programs, Mathematical Programming 14, 249–261.

    Article  Google Scholar 

  29. Ecker, J. G., Hegner, N. S. and Kouada, I. A. (1980), Generating All Maximal Efficient Faces for Multiple Objective Linear Programs, Journal of Optimization Theory and Applications 30, 353–381.

    Article  Google Scholar 

  30. Gal, T. (1977), A General Method for Determining the Set of All Efficient Solutions to a Linear Vector Maximum Problem, European Journal of Operational Research 1, 307–322.

    Article  Google Scholar 

  31. Zeleny, M. (1974), Linear Multiobjective Programming, Springer Verlag, Berlin/New York.

    Google Scholar 

  32. Benson, H. P. and Sayin, S. (1997), Towards Finding Global Representations of the Efficient Set in Multiple Objective Mathematical Programming, Naval Research Logistics 44, 47–67.

    Article  Google Scholar 

  33. Steuer, R. E. (1989), ADBASE Multiple Objective Linear Programming Package, University of Georgia, Athens, Georgia, 1989.

    Google Scholar 

  34. Dauer, J. P. and Liu, Y. H. (1990), Solving Multiple Objective Linear Programs in Objective Space, European Journal of Operational Research 46, 350–357.

    Article  Google Scholar 

  35. Dauer, J. P. and Saleh, O. A. (1990), Constructing the Set of Efficient Objective Values in Multiple Objective Linear Programs, European Journal of Operational Research 46, 358–365.

    Article  Google Scholar 

  36. Morse, J. N. (1980), Reducing the Size of the Nondominated Set: Pruning by Clustering, Computers and Operations Research 7, 55–66.

    Article  Google Scholar 

  37. Steuer, R. E. (1976), Multiple Objective Linear Programming with Interval Criterion Weights, Management Science 23, 305–316.

    Google Scholar 

  38. Steuer, R. E. and Harris, F. W. (1980), Intra-Set Point Generation and Filtering in Decision and Criterion Space, Computers and Operations Research 7, 41–53.

    Article  Google Scholar 

  39. Benson, H. P. (1995), A Geometrical Analysis of the Efficient Outcome Set in Multiple-Objective Convex Programs with Linear Criterion Functions, Journal of Global Optimization 6, 231–251.

    Article  Google Scholar 

  40. Dauer, J. P. (1987), Analysis of the Objective Space in Multiple Objective Linear Programming, Journal of Mathematical Analysis and Applications 126, 579–593.

    Article  Google Scholar 

  41. Dauer, J. P. (1993), On Degeneracy and Collapsing in the Construction of the Set of Objective Values in a Multiple Objective Linear Program, Annals of Operations Research 47, 279–292.

    Article  Google Scholar 

  42. Gallagher, R. J. and Saleh, O. A. (1995), A Representation of an Efficiency Equivalent Polyhedron for the Objective Set of a Multiple Objective Linear Program, European Journal of Operational Research 80, 204–212.

    Article  Google Scholar 

  43. Dauer, J. P. and Gallagher, R. J. (1996), A Combined Constraint-Space, Objective-Space Approach for Determining High-Dimensional Maximal Efficient Faces of Multiple Objective Linear Programs, European Journal of Operational Research 88, 368–381.

    Article  Google Scholar 

  44. Jahn, J., On the Determination of Minimal Facets and Edges of a Polyhedral Set, Journal of Multi-Criteria Decision Analysis, to appear.

  45. Armann, R. (1989), Solving Multiobjective Programming Problems by Discrete Representation, Optimization 20, 483–492.

    Google Scholar 

  46. Horst, R. and Tuy, H. (1993), Global Optimization: Deterministic Approaches, 2nd edition, Springer Verlag, Berlin/New York.

    Google Scholar 

  47. Horst, R. and Pardalos, P., eds. (1995), Handbook of Global Optimization, Kluwer Academic Publishers, Dordrecht/Boston/London.

    Google Scholar 

  48. Benson, H. P. (1996), Deterministic Algorithms for Constrained Concave Minimization: A Unified Critical Survey, Naval Research Logistics 43, 765–795.

    Article  Google Scholar 

  49. Rockafellar, R. T. (1970), Convex Analysis, Princeton University Press, Princeton, New Jersey.

    Google Scholar 

  50. Benson, H. P. and Lee, D. (1996), Outcome-Based Algorithm for Optimizing over the Efficient Set of a Bicriteria Linear Programming Problem, Journal of Optimization Theory and Applications 88, 77–105.

    Article  Google Scholar 

  51. Falk, J. E. and Hoffman, K. L. (1976), A Successive Underestimating Method for Concave Minimization Problems, Mathematics of Operations Research 1, 251–259.

    Article  Google Scholar 

  52. Tuy, H. (1983), On Outer Approximation Methods for Solving Concave Minimization Problems, Acta Mathematica Vietnamica 8, 3–34.

    Google Scholar 

  53. Thieu, T. V., Tam, B. T. and Ban, T. V. (1983), An Outer Approximation Method for Globally Minimizing a Concave Function over a Compact Convex Set, Acta Mathematica Vietnamica 8, 21–40.

    Google Scholar 

  54. Horst, R., Thoai, N. V. and Devries, J. (1988), On Finding the New Vertices and Redundant Constraints in Cutting Plane Algorithms for Global Optimization, Operations Research Letters 7, 85–90.

    Article  Google Scholar 

  55. Thieu, N. V. (1988), A Finite Method for Globally Minimizing a Concave Function over an Unbounded Polyhedral Convex Set and Its Applications, Acta Mathematica Hungarica 52, 21–36.

    Article  Google Scholar 

  56. Chen, P. C., Hansen, P. and Jaumard, B. (1991), On-Line and Off-Line Vertex Enumeration by Adjacency Lists, Operations Research Letters 10, 403–409.

    Article  Google Scholar 

  57. Horst, R. (1991), On the Vertex Enumeration Problem in Cutting Plane Algorithms of Global Optimization, in G. Fandel and H. Gehring (eds.), Operations Research, Springer Verlag, Berlin/New York, pp. 13–22.

    Google Scholar 

  58. Horst, R. and Thoai, N. V. (1989), Modification, Implementation and Comparison of Three Algorithms for Globally Solving Linearly Constrained Concave Minimization Problems, Computing 42, 271–289.

    Article  Google Scholar 

  59. Stadler, W., ed. (1988), Multicriteria Optimization in Engineering and the Sciences, Plenum Press, New York.

    Google Scholar 

  60. Benson, H. P. (1982), Admissible Points of a Convex Polyhedron, Journal of Optimization Theory and Applications 38, 341–361.

    Article  Google Scholar 

  61. International Mathematical and Statistical Libraries, Inc. (1991), The IMSL Library Reference Manual, IMSL, Houston, Texas.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. College of Business Administration, Department of Decision and Imformation Sciences, University of Florida, P.O. Box 117169, Gainesville, FL, 32611–7169, USA E-mail

    Harold P. Benson

Authors
  1. Harold P. Benson
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

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 13, 1–24 (1998). https://doi.org/10.1023/A:1008215702611

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1008215702611

Search

Navigation