Article contents
On converse duality in complex nonlinear programming
Published online by Cambridge University Press: 17 April 2009
Abstract
In this note a converse duality theorem is proved for a class of nonlinear programming problems over polyhedral cones in finite dimensional complex space by a direct use of a Kuhn-Tucker type necessary and sufficient condition for constrained optimization in complex space.
- Type
- Research Article
- Information
- Bulletin of the Australian Mathematical Society , Volume 13 , Issue 3 , December 1975 , pp. 421 - 427
- Copyright
- Copyright © Australian Mathematical Society 1975
References
- 3
- Cited by