Journal article
On equating the difference between optimal and marginal values of general convex programs
Journal of optimization theory and applications, Vol.33(1), pp.57-68
01/1981
DOI: 10.1007/BF00935176
Abstract
Unlike elementary finite linear programming, the optimal program value of a convex optimization problem is generally different from the vector product of the marginal price vector and the resource right-hand side vector. In this paper, a duality approach is developed, based on objective function parametrizations, to characterize this difference under rather general circumstances.
The approach generalizes the concept of Kuhn-Tucker vectors of a convex program. It is shown that nonstandard polynomial Kuhn-Tucker vectors exist for any convex program having finite value. Two examples illustrate the procedure.
Details
- Title: Subtitle
- On equating the difference between optimal and marginal values of general convex programs
- Creators
- K. O. Kortanek - Carnegie Mellon UniversityA. L. Soyster - Virginia Tech
- Resource Type
- Journal article
- Publication Details
- Journal of optimization theory and applications, Vol.33(1), pp.57-68
- DOI
- 10.1007/BF00935176
- ISSN
- 0022-3239
- eISSN
- 1573-2878
- Number of pages
- 12
- Language
- English
- Date published
- 01/1981
- Academic Unit
- Business Analytics
- Record Identifier
- 9984963101102771
Metrics
1 Record Views