A duality theorem for a convex programming problem in order complete vector lattices
- 1 May 1975
- journal article
- Published by Elsevier in Journal of Mathematical Analysis and Applications
- Vol. 50 (2) , 273-287
- https://doi.org/10.1016/0022-247x(75)90022-0
Abstract
No abstract availableThis publication has 7 references indexed in Scilit:
- Subdifferentiability of Convex Functions with Values in an Ordered Vector Space.MATHEMATICA SCANDINAVICA, 1974
- Sous-Différentiabilité de fonctions convexes à valeurs dans un espace vectoriel ordonné.MATHEMATICA SCANDINAVICA, 1972
- Optimization theory in linear spacesMathematische Annalen, 1970
- Optimization theory in linear spacesMathematische Annalen, 1969
- Optimization theory in linear spaces. IMathematische Annalen, 1969
- Extension of Fenchel’ duality theorem for convex functionsDuke Mathematical Journal, 1966
- On Conjugate Convex FunctionsCanadian Journal of Mathematics, 1949