{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,6]],"date-time":"2026-04-06T20:26:27Z","timestamp":1775507187170,"version":"3.50.1"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1983,9,1]],"date-time":"1983-09-01T00:00:00Z","timestamp":431222400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Mathematical Programming"],"published-print":{"date-parts":[[1983,9]]},"DOI":"10.1007\/bf02591965","type":"journal-article","created":{"date-parts":[[2007,3,29]],"date-time":"2007-03-29T15:36:08Z","timestamp":1175182568000},"page":"75-82","source":"Crossref","is-referenced-by-count":21,"title":["A duality theorem for semi-infinite convex programs and their finite subprograms"],"prefix":"10.1007","volume":"27","author":[{"given":"Dennis F.","family":"Karney","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF02591965_CR1","volume-title":"Constructive approaches to Mathematical Models","author":"A. Ben-Tal","year":"1979","unstructured":"A. Ben-Tal, E.E. Rosinger and A. Ben-Israel, \u201cA Helly type theorem and semi-infinite programming\u201d, in: C.V. Coffman and G.D. Fix, eds.,Constructive approaches to Mathematical Models (Academic Press, New York, 1979)."},{"key":"BF02591965_CR2","doi-asserted-by":"crossref","first-page":"330","DOI":"10.1007\/BF01588327","volume":"18","author":"J.M. Borwein","year":"1980","unstructured":"J.M. Borwein, \u201cA note on perfect duality and limiting Lagrangeans\u201d,Mathematical Programming 18 (1980) 330\u2013337.","journal-title":"Mathematical Programming"},{"key":"BF02591965_CR3","doi-asserted-by":"crossref","first-page":"497","DOI":"10.1007\/BF00935755","volume":"33","author":"J.M. Borwein","year":"1981","unstructured":"J.M. Borwein, \u201cThe limiting Lagrangean as a consequence of Helly's Theorem\u201d,Journal of Optimization Theory and Applications 33 (1981) 497\u2013513.","journal-title":"Journal of Optimization Theory and Applications"},{"key":"BF02591965_CR4","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1007\/BF01584251","volume":"21","author":"J.M. Borwein","year":"1981","unstructured":"J.M. Borwein, \u201cDirect theorems in semi-infinite convex programming\u201d,Mathematical Programming 21 (1981) 301\u2013308.","journal-title":"Mathematical Programming"},{"key":"BF02591965_CR5","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1287\/mnsc.12.1.113","volume":"12","author":"A. Charnes","year":"1965","unstructured":"A. Charnes, W.W. Cooper and K.O. Kortanek, \u201cOn representations of semi-infinite programs which have no duality gaps\u201d,Management Science 12 (1965) 113\u2013121.","journal-title":"Management Science"},{"key":"BF02591965_CR6","doi-asserted-by":"crossref","first-page":"122","DOI":"10.1287\/mnsc.12.1.122","volume":"12","author":"R.J. Duffin","year":"1965","unstructured":"R.J. Duffin and L.A. Karlovitz, \u201cAn infinite linear program with a duality gap\u201d,Management Science 12 (1965) 122\u2013134.","journal-title":"Management Science"},{"key":"BF02591965_CR7","doi-asserted-by":"crossref","unstructured":"R.G. Jeroslow, \u201cUniform duality in semi-infinite convex optimization\u201d,Mathematical Programming 27 (1983) to appear.","DOI":"10.1007\/BF02591942"},{"key":"BF02591965_CR8","unstructured":"D.F. Karney, \u201cDuality and approximation in semi-infinite programs\u201d, Ph.D. thesis, University of Illinois at Urbana-Champaign (1980)."},{"key":"BF02591965_CR9","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/BF01589340","volume":"20","author":"D.F. Karney","year":"1981","unstructured":"D.F. Karney, \u201cDuality gaps in semi-infinite linear programming\u2014An approximation problem\u201d,Mathematical Programming 20 (1981) 129\u2013143.","journal-title":"Mathematical Programming"},{"key":"BF02591965_CR10","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1016\/0196-8858(81)90036-1","volume":"2","author":"D.F. Karney","year":"1981","unstructured":"D.F. Karney, \u201cClark's theorem for semi-infinite convex programs\u201d,Advances in Applied Mathematics 2 (1981) 7\u201312.","journal-title":"Advances in Applied Mathematics"},{"key":"BF02591965_CR11","unstructured":"D.F. Karney, \u201cAsymptotic convex programming\u201d, Georgia Institute of Technology, Management Science Technical Report MS-81-9 (1981)."},{"key":"BF02591965_CR12","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1007\/BF00934327","volume":"38","author":"D.F. Karney","year":"1982","unstructured":"D.F. Karney, \u201cA pathological semi-infinite program verifying Karlovitz's conjecture\u201d,Journal of Optimization Theory and Applications 38 (1982) 137\u2013141.","journal-title":"Journal of Optimization Theory and Applications"},{"key":"BF02591965_CR13","unstructured":"D.F. Karney and T.D. Morley, \u201cLimiting Lagrangians\u2014A primal approach\u201d, Georgia Institute of Technology, Management Science Technical Report MS-82-3 (1982)."},{"key":"BF02591965_CR14","unstructured":"D.F. Karney, \u201cThe number of constraints in a semi-infinite program is always countable\u201d, Georgia Institute of Technology, Management Science Technical Report MS-82-5 (1982)."},{"key":"BF02591965_CR15","doi-asserted-by":"crossref","DOI":"10.1515\/9781400873173","volume-title":"Convex Analysis","author":"R.T. Rockafellar","year":"1970","unstructured":"R.T. Rockafellar,Convex Analysis (Princeton University Press, Princeton, NJ, 1970)."},{"key":"BF02591965_CR16","series-title":"CBMS\/NSF regional conference series in applied mathematics","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611970524","volume-title":"Conjugate duality and optimization","author":"R.T. Rockafellar","year":"1974","unstructured":"R.T. Rockafellar,Conjugate duality and optimization (CBMS\/NSF regional conference series in applied mathematics 16, SIAM, Philadelphia, PA, 1974)."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02591965.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02591965\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02591965","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T23:37:51Z","timestamp":1558395471000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02591965"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983,9]]},"references-count":16,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1983,9]]}},"alternative-id":["BF02591965"],"URL":"https:\/\/doi.org\/10.1007\/bf02591965","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1983,9]]}}}