Electronic Resource
Springer
Mathematical programming
15 (1978), S. 87-91
ISSN:
1436-4646
Keywords:
Lagrange Multipliers
;
Constrained Convex Optimization
;
Kuhn—Tucker Theorem
;
Duality
Source:
Springer Online Journal Archives 1860-2000
Topics:
Computer Science
,
Mathematics
Notes:
Abstract The duality theorem of linear programming is used to prove several results on convex optimization. This is done without using separating hyerplane theorems.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/BF01609002
Permalink
|
Location |
Call Number |
Expected |
Availability |