Modified Converse Duality for Multiobjective Higher Order Wolfe Type Dual Program with Cone Constraints

Authors

  • Sonali Sethi SOM, Thapar Institute oef Engineering and Technology, Patiala, India
  • Navdeep Kailey SOM, Thapar Institute of Engineering and Technology, Patiala, India
  • Shivani Saini SOM, Thapar Institute of Engineering and Technology, Patiala, India

DOI:

https://doi.org/10.2298/YJOR210915014S

Keywords:

Multiobjective programming, converse duality theorem, higher order duality, cones, efficient solutions

Abstract

In this paper, we obtain a converse duality theorem for higher order Wolfe type multiobjective programming with cone constraints under appropriate assumptions. This fills some gaps in the work of Kim et al. [Kim, D.S., Kang, H.S., Lee, Y.J., Seo, Y.Y., Higher order duality in multiobjective programming with cone constraints, Optimization, 59(1), 29–43, (2010)].

References

D. S. Kim, H. S. Kang, Y. J. Lee, and Y. Y. Seo, “Higher order duality in multiobjective programming with cone constraints,” Optimization, vol. 59, no. 1, pp. 29-43, 2010.

T. Gulati, and I. Ahmad, “Multiobjective duality using fritz john conditions,” Asia-Pacific Journal of Operational Research, vol. 15, no. 1, pp. 63-74, 1998.

X. Yang, J. Yang, T. L. Yip, and K. L. Teo, “Higher-order mond-weir converse duality in multiobjective programming involving cones,” Science China Mathematics, vol. 56, no. 11, pp. 2389-2392, 2013.

B. Craven, “Lagrangean conditions and quasiduality,” Bulletin of the Australian Mathematical Society, vol. 16, no. 3, pp. 325-339, 1977.

Downloads

Published

2022-11-29

Issue

Vol. 33 No. 2 (2023)

Section

Research Articles

License

Copyright (c) YUJOR

Creative Commons License

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.