A Strict Converse Duality Theorem in Nonlinear Programming
- 1 January 1983
- journal article
- research article
- Published by Taylor & Francis in Journal of Information and Optimization Sciences
- Vol. 4 (3) , 301-306
- https://doi.org/10.1080/02522667.1983.10698771
Abstract
Recently Mond and Weir have obtained several duals for a nonlinear programming problem. Here we give a strict converse duality theorern for their duals under different assumptions.Keywords
This publication has 4 references indexed in Scilit:
- Invex functions and constrained local minimaBulletin of the Australian Mathematical Society, 1981
- On sufficiency of the Kuhn-Tucker conditionsJournal of Mathematical Analysis and Applications, 1981
- Pseudo-Convex FunctionsJournal of the Society for Industrial and Applied Mathematics Series A Control, 1965
- A duality theorem for non-linear programmingQuarterly of Applied Mathematics, 1961