Sufficiency criteria and duality in complex nonlinear programming involving pseudoinvex function
Author:
- 1 January 1997
- journal article
- research article
- Published by Taylor & Francis in Optimization
- Vol. 39 (2) , 123-135
Abstract
Necessary conditions for optimality in polyhedral-cone constrained nonlinear complex programs are shown to be sufficient under the assumption of a particular form of generalized invexity. Duality results are thus extended for a Mond-Weir type dualKeywords
This publication has 22 references indexed in Scilit:
- On nonlinear programming in complex spacesJournal of Mathematical Analysis and Applications, 1992
- Multiobjective duality with invexityJournal of Mathematical Analysis and Applications, 1987
- Invex functions and dualityJournal of the Australian Mathematical Society. Series A. Pure Mathematics and Statistics, 1985
- Duality for a class of nondifferentiable mathematical programming problems in complex spaceJournal of Mathematical Analysis and Applications, 1984
- Second order duality and symmetric duality for non-linear programs in complex spaceJournal of Mathematical Analysis and Applications, 1983
- On duality in complex linear programmingJournal of the Australian Mathematical Society, 1973
- Nonlinear programming in complex space: Sufficient conditions and dualityJournal of Mathematical Analysis and Applications, 1972
- Nonlinear Programming in Complex Space: Necessary ConditionsSIAM Journal on Control, 1971
- Nonlinear programming in complex spaceJournal of Mathematical Analysis and Applications, 1969
- Linear equations and inequalities on finite dimensional, real or complex, vector spaces: A unified theoryJournal of Mathematical Analysis and Applications, 1969