Article contents
Characterizations of optimality for continuous convex mathematical programs. Part I. Linear constraints
Published online by Cambridge University Press: 17 February 2009
Abstract
Recently we have developed a completely symmetric duality theory for mathematical programming problems involving convex functionals. Here we set our theory within the framework of a Lagrangian formalism which is significantly different to the conventional Lagrangian. This allows various new characterizations of optimality.
- Type
- Research Article
- Information
- Copyright
- Copyright © Australian Mathematical Society 1979
References
- 1
- Cited by