Journal article
Asymptotic duality over closed convex sets
Journal of mathematical analysis and applications, Vol.35(3), pp.677-691
01/01/1971
DOI: 10.1016/0022-247X(71)90214-9
Abstract
The asymptotic duality theory of linear programming over closed convex cones [4] is extended to closed convex sets, by embedding such sets in appropriate cones. Applications to convex programming and to approximation theory are given. © 1971.
Details
- Title: Subtitle
- Asymptotic duality over closed convex sets
- Creators
- A. Ben-Israel - Technion – Israel Institute of TechnologyA. Charnes - The University of Texas at AustinK. O. Kortanek - Carnegie Mellon University
- Resource Type
- Journal article
- Publication Details
- Journal of mathematical analysis and applications, Vol.35(3), pp.677-691
- DOI
- 10.1016/0022-247X(71)90214-9
- ISSN
- 0022-247X
- eISSN
- 1096-0813
- Number of pages
- 15
- Grant note
- DA-3ll24-ARO-D-322; GP-7550 / National Science Foundation (http://data.elsevier.com/vocabulary/SciValFunders/100000001) N300014-67-A-0126-0009; NONR 760(24) NR 047-048; NSF-GP 2729 / Northwestern University (http://data.elsevier.com/vocabulary/SciValFunders/100007059)
- Language
- English
- Date published
- 01/01/1971
- Academic Unit
- Business Analytics
- Record Identifier
- 9984963116902771
Metrics
3 Record Views