Skip to main content
SpringerLink
Log in

Major-efficient solutions and weakly major-efficient solutions of multiobjective programming

  • Published:
Applied Mathematics Aims and scope Submit manuscript

Abstract

In this paper, the theory of major efficiency for multiobjective programming is established. The major-efficient solutions and weakly major-efficient solutions of multiobjective programming given here are Pareto efficient solutions of the same multiobjective programming problem, but the converse is not true. In a ceratin sense, these solutions are in fact better than any other Pareto efficient solutions. Some basic theorems which characterize major-efficient solutions and weakly major-efficient solutions of multiobjective programming are stated and proved. Furthermore, the existence and some geometric properties of these solutions are studied.

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. Stadler, W., A survey of multicriteria optimization or the vector maximum problem, Part I:1776–1960,J. Optim. Theory Appl.,29:1 (1979), 1–52.

    Article  MATH  Google Scholar 

  2. Dauer, J. P., and Stadler, W., A survey of vector optimization in infinite- dimensional spaces, Part II,J. Optim. Theory Appl.,51:1 (1986), 205–241.

    Article  MATH  Google Scholar 

  3. White, D. J., Optimality and Efficiency, Wiley, New York, 1982.

    MATH  Google Scholar 

  4. Chankong, V. and Nakayama, Y. Y., Multiobjective Decision Making: Theory and Methodology, North-Holland, New York, 1983

    MATH  Google Scholar 

  5. Sawaragi, Y., Nakayama, H. and Tanino, T., Theory of Multiobjective Optimization, Academia Press, New York, 1985.

    MATH  Google Scholar 

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

    MATH  Google Scholar 

  7. Geoffrion, A. M., Proper efficiency and the theory of vector maximization,J. Math. Anal. Appl.,22 (1968), 618–630.

    Article  MATH  Google Scholar 

  8. Borwein, J. M., Proper efficiency points for maximizations with respect to cones,SIAM J. Control Optim. 15 (1977), 57–63.

    Article  MATH  Google Scholar 

  9. Hartley, R., On cone-efficiency, cone-convexity, and cone-compactness,J. Math. Anal. Appl.,34 (1978), 211–222.

    MATH  Google Scholar 

  10. Benson, H. P., An improved definition of proper efficiency for vector minimization with respect to cones,J. Math. Anal. Appl.,35 (1979), 232–241.

    Article  Google Scholar 

  11. Hening, M. I., Proper efficiency with respect to cones,J. Opti. Theory Appl.,36 (1982), 387–407.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Appl. Math., Shanghai Jiao Tong Univ., 200030, Shanghai

    Hu Yuda

Authors
  1. Hu Yuda
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Supported by the National Natural Science Foundation of China.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Yuda, H. Major-efficient solutions and weakly major-efficient solutions of multiobjective programming. Appl. Math. 9, 85–94 (1994). https://doi.org/10.1007/BF02662029

Download citation

  • Received:

  • Issue Date:

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

Key Words

AMS Subject Classification

Search

Navigation