Article contents
Optimality and duality without a constraint qualification for minimax programming
Published online by Cambridge University Press: 17 April 2009
Abstract
Without the need of a constraint qualification, we establish the optimality necessary and sufficient conditions for generalised minimax programming. Using these optimality conditions, we construct a parametric dual model and a parameter-free mixed dual model. Several duality theorems are established.
- Type
- Research Article
- Information
- Bulletin of the Australian Mathematical Society , Volume 67 , Issue 1 , February 2003 , pp. 121 - 130
- Copyright
- Copyright © Australian Mathematical Society 2003
References
REFERENCES
- 2
- Cited by