Skip to main content Accessibility help
×
Home

Efficiency and generalised convexity in vector optimisation problems

  • Pham Huu Sach (a1), Gue Myung Lee (a2) and Do Sang Kim (a2)

Abstract

This paper gives a necessary and sufficient condition for a Kuhn-Tucker point of a non-smooth vector optimisation problem subject to inequality and equality constraints to be an efficient solution. The main tool we use is an alternative theorem which is quite different to a corresponding result by Xu.

    • Send article to Kindle

      To send this article to your Kindle, first ensure no-reply@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about sending to your Kindle. Find out more about sending to your Kindle.

      Note you can select to send to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be sent to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

      Find out more about the Kindle Personal Document Service.

      Efficiency and generalised convexity in vector optimisation problems
      Available formats
      ×

      Send article to Dropbox

      To send this article to your Dropbox account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Dropbox.

      Efficiency and generalised convexity in vector optimisation problems
      Available formats
      ×

      Send article to Google Drive

      To send this article to your Google Drive account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Google Drive.

      Efficiency and generalised convexity in vector optimisation problems
      Available formats
      ×

Copyright

References

Hide All
[1]Aubin, J. P., Mathematical methods of game and economic theory (North-Holland, Amsterdam, 1979).
[2]Benson, H. P., “Concave minimization: theory, applications and algorithms”, in Handbook of global optimization (eds. Horst, R. and Pardalos, P. M.), (Kluwer, Dordrecht, 1995) 43148.
[3]Blackwell, D. and Girshick, M. A., Theory of games and statistical decisions (John Wiley and Sons, New York, 1954).
[4]Brandas, A. J. V., Rojas-Medar, M. A. and Silva, G. N., “Invex nonsmooth alternative theorem and applications”, Optimization 48 (2000) 239253.
[5]Clarke, F. H., Optimization and nonsmooth analysis (Wiley-Interscience, New York, 1983).
[6]Craven, B. D., “Nondifferentiable optimization by nonsmooth approximations”, Optimization 17 (1986) 317.
[7]Ferguson, T. S., Mathematical statistics: a decision theoretic approach (Academic Press, New York, 1967).
[8]Geoffrion, A. M., “Proper efficiency and the theory of vector maximization”, J. Math. Anal. Appl. 22 (1968) 618630.
[9]Hanson, M. A., “On sufficiency of the Kuhn-Tucker conditions”, J. Math. Anal. Appl. 80 (1981) 545550.
[10]Hanson, M. A., “Invexity and the Kuhn-Tucker theorem”, J. Math. Anal. Appl. 236 (1999) 594604.
[11]Hanson, M. A. and Mond, B., “Necessary and sufficient conditions in constrained optimization”, Math. Programming 37 (1987) 5158.
[12]Mangasarian, O. L., Nonlinear programming (McGraw-Hill, New York, 1969).
[13]Martin, D. H., “The essence of invexity”, J. Optim. Th. Appl. 47 (1985) 6576.
[14]Osuna-Gómez, R., Beato-Moreno, A. and Rufian-Lizana, A., “Generalized convexity in multiobjective programming”, J. Math. Anal. Appl. 233 (1999) 205220.
[15]Osuna-Gómez, R., Rufian-Lizana, A. and Ruiz-Canalez, P., “Invex functions and generalized convexity in multiobjective programming”, J. Optim. Th. Appl. 98 (1998) 651661.
[16]Pareto, V., Manuale di economia politica, con una introduzione ulla scienza sociale (Societa Editrice Libraria, Milan, Italy, 1906).
[17]Phuong, T. D., Sach, P. H. and Yen, N. D., “Strict lower semicontinuity of the level sets and invexity of a locally Lipschitz function”, J. Optim. Th. Appl. 87 (1995) 579594.
[18]Reiland, T. W., “Nonsmooth invexity”, Bull. Austral. Math. Soc. 42 (1990) 437446.
[19]Sach, P. H., Kim, D. S. and Lee, G. M., “Generalized convexity and nonsmooth problems of vector optimization”, Preprint 2000/31, Hanoi Institute of Mathematics, (submitted).
[20]Sach, P. H., Kim, D. S. and Lee, G. M., “Invexity as necessary optimality condition in nonsmooth programs”, Preprint 2000/30, Hanoi Institute of Mathematics, (submitted).
[21]Sach, P. H., Lee, G. M. and Kim, D.S., “Infine functions, nonsmooth alternative theorems and vector optimization problems”, J. Global Optim. 27 (2003) 5181.
[22]Takayama, A., Mathematical economics (The Dryden Press, Illinois, 1974).
[23]Xu, Z., “Generalization of nonhomogeneous Farkas' lemma and applications”, J. Math. Anal. Appl. 186 (1994) 726734.
[24]Zeleny, M., Multiple criteria decision making (McGraw-Hill, New York, 1982).
MathJax
MathJax is a JavaScript display engine for mathematics. For more information see http://www.mathjax.org.

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed