{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T17:49:21Z","timestamp":1649180961021},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1980,12,1]],"date-time":"1980-12-01T00:00:00Z","timestamp":344476800000},"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":[[1980,12]]},"DOI":"10.1007\/bf01588298","type":"journal-article","created":{"date-parts":[[2005,4,28]],"date-time":"2005-04-28T20:15:32Z","timestamp":1114719332000},"page":"68-83","source":"Crossref","is-referenced-by-count":3,"title":["Bounding a class of nonconvex linearly-constrained resource allocation problems via the surrogate dual"],"prefix":"10.1007","volume":"18","author":[{"given":"Dennis L.","family":"Bricker","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"382","DOI":"10.4153\/CJM-1954-037-2","volume":"6","author":"S. Agmon","year":"1954","unstructured":"S. Agmon, \u201cThe relaxation method for linear inequalities\u201d,Canadian Journal of Mathematics 6 (1954) 382\u2013392.","journal-title":"Canadian Journal of Mathematics"},{"key":"CR2","first-page":"16","volume":"7","author":"D. Bricker","year":"1978","unstructured":"D. Bricker and T.S. Chang, \u201cA surrogate dual for the plant location problem\u201d,SCIMA 7 (1978) 16\u201326.","journal-title":"SCIMA"},{"key":"CR3","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1002\/nav.3800210206","volume":"21","author":"A. Cabot","year":"1974","unstructured":"A. Cabot, \u201cVariations on a cutting plane method for solving concave minimization problems with linear constraints\u201d,Naval Research Logistics Quarterly 21 (1974) 265\u2013274.","journal-title":"Naval Research Logistics Quarterly"},{"key":"CR4","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1007\/BF01584324","volume":"13","author":"M. Carrillo","year":"1977","unstructured":"M. Carrillo, \u201cA relaxation algorithm for the minimization of a quasiconcave function on a convex polyhedron\u201d,Mathematical Programming 13 (1977) 69\u201380.","journal-title":"Mathematical Programming"},{"key":"CR5","doi-asserted-by":"crossref","first-page":"534","DOI":"10.1137\/0307039","volume":"7","author":"J. Falk","year":"1969","unstructured":"J. Falk, \u201cLagrange multipliers and nonconvex programs\u201d,SIAM Journal of Control 7 (1969) 534\u2013545.","journal-title":"SIAM Journal of Control"},{"key":"CR6","unstructured":"J. Falk, \u201cAn algorithm for locating approximate global solutions of nonconvex, separable problems\u201d, Technical Paper T-262, Program in Logistics, George Washington University Washington, D.C. (1972)."},{"key":"CR7","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1287\/moor.1.3.251","volume":"1","author":"J. Falk","year":"1976","unstructured":"J. Falk and K. Hoffman, \u201cA successive underestimation method for concave minimization problems\u201d,Mathematics of Operations Research 1 (1976) 251\u2013259.","journal-title":"Mathematics of Operations Research"},{"key":"CR8","doi-asserted-by":"crossref","first-page":"446","DOI":"10.1287\/mnsc.19.4.446","volume":"19","author":"J. Falk","year":"1972","unstructured":"J. Falk and J. Horowitz, \u201cCritical path problems with concave cost-time curves\u201d,Management Science 19 (1972) 446\u2013455.","journal-title":"Management Science"},{"key":"CR9","doi-asserted-by":"crossref","first-page":"550","DOI":"10.1287\/mnsc.15.9.550","volume":"15","author":"J. Falk","year":"1969","unstructured":"J. Falk and R. Soland, \u201cAn algorithm for separable nonconvex programming problems\u201d,Management Science 15 (1969) 550\u2013562.","journal-title":"Management Science"},{"key":"CR10","unstructured":"Harvey J. Greenberg, \u201cLagrangian duality gaps: their source and resolution\u201d, Tech. Rept. CP-69005, Southern Methodist University (1969)."},{"key":"CR11","doi-asserted-by":"crossref","first-page":"924","DOI":"10.1287\/opre.18.5.924","volume":"18","author":"Harvey J. Greenberg","year":"1970","unstructured":"Harvey J. Greenberg, and W.P. Pierskalla, \u201cSurrogate mathematical programming\u201d,Operations Research 18 (1970) 924\u2013939.","journal-title":"Operations Research"},{"key":"CR12","first-page":"437","volume":"15","author":"Harvey J. Greenberg","year":"1973","unstructured":"Harvey J. Greenberg and W.P. Pierskalla, \u201cQuasi-conjugate functions and surrogate duality\u201d,Cahiers du Centre l'\u00c9tudes de Recherche Operationelle 15 (1973) 437\u2013448.","journal-title":"Cahiers du Centre l'\u00c9tudes de Recherche Operationelle"},{"key":"CR13","doi-asserted-by":"crossref","first-page":"312","DOI":"10.1007\/BF01580678","volume":"10","author":"R. Horst","year":"1976","unstructured":"R. Horst, \u201cAn algorithm for nonconvex programming problems\u201d,Mathematical programming 10 (1976) 312\u2013321.","journal-title":"Mathematical programming"},{"key":"CR14","volume-title":"Optimization techniques II, IFIP Conference on Optimization Techniques, Nice, 1975","author":"R. Horst","year":"1976","unstructured":"R. Horst, \u201cA new branch and bound approach for concave minimization problems\u201d, in: Jean Cea, ed.,Optimization techniques II, IFIP Conference on Optimization Techniques, Nice, 1975 (Springer, Berlin, 1976)."},{"key":"CR15","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1287\/mnsc.16.1.67","volume":"16","author":"A. Jones","year":"1969","unstructured":"A. Jones and R. Soland, \u201cA branch and bound algorithm for multi-level fixed charge problems\u201d,Management Science 16 (1969) 67\u201376.","journal-title":"Management Science"},{"key":"CR16","volume-title":"Nonlinear programming theory and methods","author":"B. Martos","year":"1975","unstructured":"B. Martos,Nonlinear programming theory and methods (North-Holland, Amsterdam, 1975) Ch. 5."},{"key":"CR17","first-page":"209","volume-title":"Numerical methods for nonlinear optimization","author":"G.P. McCormick","year":"1972","unstructured":"G.P. McCormick, \u201cAttempts to calculate global solutions of problems that may have local minima\u201d, in: F.A. Lootsma, ed.,Numerical methods for nonlinear optimization (Academic Press, New York, 1972) pp. 209\u2013221."},{"key":"CR18","volume-title":"Applications of mathematical programming techniques","author":"P. Rech","year":"1970","unstructured":"P. Rech and L.G. Barton, \u201cA non-convex transportation algorithm\u201d, in: E.M.L. Beale, ed.,Applications of mathematical programming techniques (American Elsevier, New York, 1970)."},{"key":"CR19","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":"CR20","unstructured":"R.M. Soland, \u201cAn algorithm for separable piecewise convex programming problems\u201d, Research Report CS60, Center for Cybernetics Studies, University of Texas (August 1971)."},{"key":"CR21","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1287\/opre.22.2.373","volume":"22","author":"R.M. Soland","year":"1974","unstructured":"R.M. Soland, \u201cOptimal facility location with concave costs\u201d,Operations Research 22 (1974) 373\u2013382.","journal-title":"Operations Research"},{"key":"CR22","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1002\/nav.3800200313","volume":"20","author":"H.A. Taha","year":"1973","unstructured":"H.A. Taha, \u201cConcave minimization over a convex polyhedron\u201d,Naval Research Logistics Quarterly 20 (1973) 533\u2013548.","journal-title":"Naval Research Logistics Quarterly"},{"key":"CR23","first-page":"1437","volume":"5","author":"H. Tui","year":"1964","unstructured":"H. Tui, \u201cConcave programming under linear constraints\u201d,Soviet Mathematics 5 (1964) 1437\u20131400.","journal-title":"Soviet Mathematics"},{"key":"CR24","doi-asserted-by":"crossref","first-page":"602","DOI":"10.1287\/opre.22.3.602","volume":"22","author":"P.B. Zwart","year":"1974","unstructured":"P.B. Zwart, \u201cGlobal maximization of a convex function with linear inequality constraints\u201d,Operations Research 22 (1974) 602\u2013609.","journal-title":"Operations Research"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01588298.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01588298\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01588298","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T15:31:50Z","timestamp":1556897510000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01588298"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1980,12]]},"references-count":24,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1980,12]]}},"alternative-id":["BF01588298"],"URL":"https:\/\/doi.org\/10.1007\/bf01588298","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1980,12]]}}}