Abstract
In 1975 Mangasarian formulated a higher order dual to the nonlinear programming problem: Minimize ¦(x) Subject to g(x) ≥ 0. He did not prove weak duality find hence only gave a limited strong duality theorem. Subsequently, Mond and Weir gave conditions for full duality find, as well, formulated other higher order duals. Here we give invexity type conditions under which duality holds between the above problem and various higher order dual programming problems.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bector, C. R. and Bector, B. K., (Generalised)-Binvex Functions and Second Order Duality for a Nonlinear Programming Problem, Congressus Numerantium, 22 (1986), 37–52.
Ben-Israel, A. and Mond, B., What Is Invexity?, J. Austral. Math. Soc. Ser. B 28 (1986), 1 - 9.
Craven, B. D., Duality for Generalized Convex Fractional Programming, in Generalized Concavity in Optimization and Economics, eds, S. Schaible and W. T. Ziemba, Academic Press, New York (1981), 473–489.
Egudo, R. R. and Hanson, M. A., Second Order Duality in Multiobjective Programming, Opsearch, 30 (1993), 223–230.
Hanson, M. A., On Sufficiency of the Kuhn-Tucker Conditions, J. Math. Anal. Appl, 80 (1981), 545–550.
Jeyakumar, V. and Mond, B., On Generalised Convex Mathematical Programming, J. Austral. Math. Soc. Ser. B 34 (1992), 43–53.
Kuhn, H. W. and Tucker, A. W., Nonlinear Programming, Proc. of the 2nd Berkeley Symposium on Mathematical Statistics and Probability, Univ. of California Press (1951), 481–492.
Mangasarian, O. L., Nonlinear Programming, McGraw-Hill, New York, 1969.
Mangasarian, O. L., Second and Higher-Order Duality in Nonlinear Programming, J. Math. Anal. Appl. 51 (1975), 607–620.
Mond, B. and Weir, T., Generalized Convexity and Higher Order Duality, J. Math. Sci, 16–18 (1981–1983), 74–94.
Mond, B. and Zhang, J., Duality for Multiobjective Programming Involving Second Order V-invex Functions, in Proceedings of Optimization Miniconference, B. M. Glover and V. Jeyakumar, editors, University of New South Wales, Sydney, Australia, 1995, 89–100.
Wolfe, P., A Duality Theorem for Nonlinear Programming, Quart. Appl. Math, 19 (1961), 239–244.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1998 Kluwer Academic Publishers. Printed in the Netherlands
About this chapter
Cite this chapter
Mond, B., Zhang, J. (1998). Higher Order Invexity and Duality in Mathematical Programming. In: Crouzeix, JP., Martinez-Legaz, JE., Volle, M. (eds) Generalized Convexity, Generalized Monotonicity: Recent Results. Nonconvex Optimization and Its Applications, vol 27. Springer, Boston, MA. https://doi.org/10.1007/978-1-4613-3341-8_17
Download citation
DOI: https://doi.org/10.1007/978-1-4613-3341-8_17
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-3343-2
Online ISBN: 978-1-4613-3341-8
eBook Packages: Springer Book Archive