Skip to main content
Log in

Optimization over the efficient set

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

Abstract

This paper deals with the problem of maximizing a function over the efficient set of a linear multiple objective program. The approach is to formulate a biobjective program with an appropriate efficient set. The penalty function approach is motivated by an auxiliary problem due to Benson.

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

Access this article

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

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Ecker, J. G. and Kouada, I.A. (1975), Finding Efficient Points for Linear Multiple Objective Programs,Mathematical Programming 8, 375–377.

    Google Scholar 

  2. Isermann, H. and Steuer, R. (1987), Computational Experience Concerning Payoff Tables and Minimum Criterion Values over the Efficient Set,European Journal of Operational Research 33, 91–97.

    Google Scholar 

  3. Philip, J. (1972), Algorithms for the Vector-Maximization Problem,Mathematical Programming 2, 459–467.

    Google Scholar 

  4. Steuer, R. (1986),Multiple Criteria Optimization, Wiley, New York.

    Google Scholar 

  5. Benson, H. P. (1984), Optimization over the Efficient Set,Journal of Mathematical Analysis and Applications 98, 562–580.

    Google Scholar 

  6. Benson, H. P. (1981), Optimization over the Efficient Set, Discussion Paper No. 35, Center for Econometrics and Decision Sciences, Univ. of Florida, Gainesville, Florida.

    Google Scholar 

  7. Dessouky, M., Ghiassi, M., and Davis, W. (1986),Estimates of the Minimum Nondominated Criterion Values in Multi-Criteria Decision Making, Engineering Costs and Production Economics10, 95–104.

    Google Scholar 

  8. Reeves, G. and Reid, R. (1988), Minimum Values over the Efficient Set in Multiple Objective Decision Making,European Journal of Operational Research 36, 334–338.

    Google Scholar 

  9. Rhode, R. and Weber, R. (1984), The Range of the Efficient Frontier in Multiple Objective Linear Programming,Mathematical Programming 28, 84–95.

    Google Scholar 

  10. Weistroffer, H. R. (1985), Careful Usage of Pessimistic Values is Needed in Multiple Objective Optimization,Operations Research Letters 4, 23–25.

    Google Scholar 

  11. Bolintineanu, S. (1993), Minimization of a Quasi-Concave Function over an Efficient Set,Mathematical Programming 61, 89–110.

    Google Scholar 

  12. Bolintineanu, S. (1993), Necessary Conditions for Nonlinear Suboptimization over the Weakly-Efficient Set,Journal of Optimization Theory and Applications 78, 579–598.

    Google Scholar 

  13. Luenberger, D. G. (1984),Linear and Nonlinear Programming, Addison-Wesley, Reading, Massachusetts.

    Google Scholar 

  14. Fosnaugh, T. A. (1993), Optimization over and Connectedness of the Efficient Set(s), Ph.D. Thesis, University of Nebraska, Lincoln, Nebraska.

    Google Scholar 

  15. Arrow, K. J., Barankin, E. W., and Blackwell, D. (1953), Admissible Points of Convex Sets, inContributions to the Theory of Games, Vol. II, H. W. Kuhn and A. W. Tucker, eds., Princeton University Press, Princeton, New Jersey, pp. 87–91.

    Google Scholar 

  16. Horst, R. and Tuy, H. (1993),Global Optimization: Deterministic Approaches, Second Ed., Springer-Verlag, Berlin, 1993.

    Google Scholar 

  17. Fülöp, J. (1994) A Cutting Plane Algorithm for Linear Optimization over the Efficient Set inGeneralized Convexity, Komlosi, S., Rapcsak, T., and Schaible, S., eds., Springer-Verlag, Berlin, pp. 374–385.

    Google Scholar 

  18. Yu, P. L., Cone Convexity, Cone Extreme Points, and Nondominated Solutions in Decision Problems with Multiobjectives,Journal of Optimization Theory and Applications 14, 319–377.

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

    Google Scholar 

  20. Benson, H. P., Concave Minimization: Theory, Applications and Algorithms, inHandbook of Global Optimization, R. Horst and P. Pardalos, eds., Kluwer Academic Publishers, pp. 43–148.

  21. Benson, H. P. (1992), A Finite, Non-Adjacent Extreme Point Search Algorithm for Optimization over the Efficient Set,Journal of Optimization Theory and Applications 73, 47–64.

    Google Scholar 

  22. Benson, H. P. and Sayin, S. (1993), A Face Search Heuristic Algorithm for Optimizing over the Efficient Set,Naval Research Logistics 40, 103–116.

    Google Scholar 

  23. Benson, H. P. and Sayin, S. (1994), Optimization over the Efficient Set: Four Special Cases,Journal of Optimization Theory and Applications 80, 3–18.

    Google Scholar 

  24. Benson, H. P. (1991), An All-Linear Programming Relaxation Algorithm for Optimizing over the Efficient Set,Journal of Global Optimization 1, 83–104.

    Google Scholar 

  25. Bolintineanu, S. (1993), Optimality Conditions for Minimization over the (Weakly or Properly) Efficient Set,Journal of Mathematical Analysis and Applications 173, 523–541.

    Google Scholar 

  26. Dauer, J. P. (1991), Optimization over the Efficient Set Using an Active Constraint Approach,Zeitschrift für Operations Research 35, 185–195.

    Google Scholar 

  27. Muu, L. D. (1996), A Method for Optimizing a Linear Function over the Efficient Set,Journal of Global Optimization, to appear.

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Dauer, J.P., Fosnaugh, T.A. Optimization over the efficient set. J Glob Optim 7, 261–277 (1995). https://doi.org/10.1007/BF01279451

Download citation

  • Received:

  • Accepted:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01279451

Key words

Navigation