Article contents
Strong pseudo-convexity and symmetric duality in nonlinear programming
Published online by Cambridge University Press: 17 February 2009
Abstract
In this note, the weak duality theorem of symmetric duality in nonlinear programming and some related results are established under weaker (strongly Pseudo-convex/strongly Pseudo-concave) assumptions. These results were obtained by Bazaraa and Goode [1] under (stronger) convex/concave assumptions on the function.
- Type
- Research Article
- Information
- Copyright
- Copyright © Australian Mathematical Society 1985
References
- 3
- Cited by