{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T05:24:31Z","timestamp":1648963471764},"reference-count":5,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1976,12,1]],"date-time":"1976-12-01T00:00:00Z","timestamp":218246400000},"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":[[1976,12]]},"DOI":"10.1007\/bf01580372","type":"journal-article","created":{"date-parts":[[2005,4,28]],"date-time":"2005-04-28T09:55:54Z","timestamp":1114682154000},"page":"81-88","source":"Crossref","is-referenced-by-count":8,"title":["On A characterization of optimality in convex programming"],"prefix":"10.1007","volume":"11","author":[{"given":"A.","family":"Ben-Israel","sequence":"first","affiliation":[]},{"given":"A.","family":"Ben-Tal","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","unstructured":"A. Ben-Tal, A. Ben-Israel and S. Zlobec, \u201cCharacterization of optimality in convex programming without constraint qualification\u201d,Journal of Optimization Theory and Applications, to appear.","DOI":"10.1007\/BF00933129"},{"key":"CR2","volume-title":"Proceedings of the Second Berkeley Symposium on Mathematical Statistics and Probability","author":"H.W. Kuhn","year":"1951","unstructured":"H.W. Kuhn and A.W. Tucker, \u201cNonlinear programming\u201d, in: J. Neyman, ed.,Proceedings of the Second Berkeley Symposium on Mathematical Statistics and Probability (Univ. California Press, Berkeley, 1951)."},{"key":"CR3","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1137\/1009007","volume":"9","author":"J. Ponstein","year":"1967","unstructured":"J. Ponstein, \u201cSeven kinds of convexity\u201d,SIAM Review 9 (1967) 115\u2013119.","journal-title":"SIAM Review"},{"key":"CR4","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1007\/BF00932472","volume":"7","author":"R.T. Rockafellar","year":"1971","unstructured":"R.T. Rockafellar, \u201cOrdinary convex programs without a duality gap\u201d,Journal of Optimization Theory and Applications 7 (1971) 143\u2013148.","journal-title":"Journal of Optimization Theory and Applications"},{"key":"CR5","volume-title":"Nonlinear Programming","author":"R.T. Rockafellar","year":"1970","unstructured":"R.T. Rockafellar, \u201cSome convex programs whose duals are linearly constrained\u201d, in: J.B. Rosen, O.L. Mangasarian and K. Ritter, eds.,Nonlinear Programming (Academic Press, New York, 1970)."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01580372.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01580372\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01580372","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T15:12:07Z","timestamp":1556896327000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01580372"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1976,12]]},"references-count":5,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1976,12]]}},"alternative-id":["BF01580372"],"URL":"https:\/\/doi.org\/10.1007\/bf01580372","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1976,12]]}}}