Skip to main content

Higher Order Convexity and Duality in Multiobjective Programming Problems

  • Chapter
Progress in Optimization

Part of the book series: Applied Optimization ((APOP,volume 30))

Abstract

In this paper, a kind of generalized convexity named higher order (F, ρ)-convexity is introduced to establish higher order duality for multiobjective programming problems.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. G. Bitran, Duality in Nonlinear Multiple Criteria Optimization Problems. Journal of Optimization Theory and Applications, 35, 1981, 367–406.

    Article  MathSciNet  MATH  Google Scholar 

  2. B.D. Craven, Lagrangian conditions and quasiduality. Bulletin of the Australian Mathematical Society, 16, 1977, 325–339.

    Article  MathSciNet  MATH  Google Scholar 

  3. B.D. Craven, Strong Vector Minimization and Duality. Zeitschrift für Angewandte Mathematik und Mechanik, 60, 1980, 1–5.

    Article  MathSciNet  MATH  Google Scholar 

  4. R.R. Egudo, Proper efficiency and multiobjective duality in non-linear programming. Journal of Information and Optimization Sciences, 8, 1987, 155–166.

    MathSciNet  MATH  Google Scholar 

  5. R.R. Egudo, Efficiency and generalized convex duality for multiobjective programs. Journal of Mathematical Analysis and Applications, 138, 1989, 84–94.

    Article  MathSciNet  MATH  Google Scholar 

  6. R.R. Egudo and M.A. Hanson, Second order Duality in Multiobjective Programming. Opsearch, 30, 1993, 223–230.

    MATH  Google Scholar 

  7. T.R. Gulati and M.A. Islam, Sufficiency and duality in multiobjective programming involving generalized F-convex functions. Journal of Mathematical Analysis and Applications, 183, 1994, 181–195.

    Article  MathSciNet  MATH  Google Scholar 

  8. M.A. Hanson and B. Mond, Further generalizations of convexity in mathematical programming. Journal of Information and Optimization Sciences, 3, 1982, 22–35.

    MathSciNet  Google Scholar 

  9. E.H. Ivanov and R. Nehse, Some Results on Dual Vector Optimization Problems. Optimization, 16, 1985, 505–517.

    Article  MathSciNet  Google Scholar 

  10. V. Jeyakumar, Strong and weak invexity in mathematical programming. Methods of Operations Research, 55, 1985, 109–125.

    MathSciNet  MATH  Google Scholar 

  11. V. Jeyakumar and B. Mond, On generalised convex mathematical programming. Journal of the Australian Mathematical Society (Series B), 34, 1992, 43–53.

    Article  MathSciNet  MATH  Google Scholar 

  12. O.L. Mangasarian, Nonlinear programming. McGraw-Hill, New York, 1969.

    MATH  Google Scholar 

  13. O.L. Mangasarian, Second and higher-order duality in nonlinear program¬ming. Journal of Mathematical Analysis and Applications, 51, 1975, 607–620.

    Article  MathSciNet  Google Scholar 

  14. B. Mond and T. Weir, Generalized convexity and higher order duality, Journal of Mathematical Sciences, 16–18 (1981–1983), 74–94.

    Google Scholar 

  15. B. Mond and J. Zhang, Duality for multiobjective programming involving second order V-invex functions. In Proceeding of Optimization Miniconference, B.M. Glover and V. Jeyakumar, eds., University of New South Wales, Sydney, Australia, 1995, 89–100.

    Google Scholar 

  16. V. Preda, On efficiency and duality for multiobjective programs. Journal of Mathematical Analysis and Applications, 166, 1992, 365–377.

    Article  MathSciNet  MATH  Google Scholar 

  17. T. Tanino and Y. Sawaragi, Duality Theory in multiobjective Programming. Journal of Optimization Theory and Applications, 27 1979, 509–529.

    Article  MathSciNet  MATH  Google Scholar 

  18. J.P. Vial, Strong and weak convexity of sets and functions. Mathematics of Operations Research, 8, 1983, 231–259.

    Article  MathSciNet  MATH  Google Scholar 

  19. T. Weir, Proper Efficiency and Duality for Vector Valued Optimization Problems. Journal of the Australian Mathematical Society (Series A), 43, 1987, 21–34.

    Article  MathSciNet  MATH  Google Scholar 

  20. T. Weir and B. Mond, Generalised convexity and duality in multiple objective programming. Bulletin of the Australian Mathematical Society, 39, 1989, 287–299.

    Article  MathSciNet  MATH  Google Scholar 

  21. D.G. White, Vector Maximization and Lagrange Multipliers. Mathematical Programming, 31, 1985, 192–205.

    Article  MathSciNet  MATH  Google Scholar 

  22. P. Wolfe, A duality theorem for nonlinear programming. Quarterly Applied Mathematics, 19, 1961, 239–244.

    MathSciNet  MATH  Google Scholar 

  23. Z. Xu, Mixed type duality in Multiobjective programming problems. Journal of Mathematical Analysis and Applications, 198, 1996, 621–635.

    Article  MathSciNet  MATH  Google Scholar 

  24. J. Zhang and B. Mond, Second order duality for multiobjective non-linear programming involving generalized convexity. In The Proceedings of the Optimization Miniconference III (The University of Melbourne, July 18 1996), B.M. Glover, B.D. Craven and D. Ralph eds., University of Ballarat, Ballarat, 1997, 79–95.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Kluwer Academic Publishers

About this chapter

Cite this chapter

Zhang, J. (1999). Higher Order Convexity and Duality in Multiobjective Programming Problems. In: Progress in Optimization. Applied Optimization, vol 30. Springer, Boston, MA. https://doi.org/10.1007/978-1-4613-3285-5_6

Download citation

  • DOI: https://doi.org/10.1007/978-1-4613-3285-5_6

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4613-3287-9

  • Online ISBN: 978-1-4613-3285-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics