{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,28]],"date-time":"2025-07-28T21:53:01Z","timestamp":1753739581419},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1987,6,1]],"date-time":"1987-06-01T00:00:00Z","timestamp":549504000000},"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":[[1987,6]]},"DOI":"10.1007\/bf02591693","type":"journal-article","created":{"date-parts":[[2007,3,29]],"date-time":"2007-03-29T11:45:41Z","timestamp":1175168741000},"page":"169-183","source":"Crossref","is-referenced-by-count":25,"title":["Nondifferentiable reverse convex programs and facetial convexity cuts via a disjunctive characterization"],"prefix":"10.1007","volume":"37","author":[{"given":"S.","family":"Sen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hanif D.","family":"Sherali","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF02591693_CR1","first-page":"307","volume-title":"Optimization and Design","author":"M. Avriel","year":"1973","unstructured":"M. Avriel, \u201cMethods for solving signomial and reverse convex programming problems,\u201d in: M. Avriel, M.J. Rijckaert and D.J. Wilde, eds.,Optimization and Design (Prentice-Hall, Englewood Cliffs, NJ, 1973) pp. 307\u2013320."},{"key":"BF02591693_CR2","volume-title":"Nonlinear Programming: Analysis and Methods","author":"M. Avriel","year":"1976","unstructured":"M. Avriel,Nonlinear Programming: Analysis and Methods (Prentice-Hall, Englewood Cliffs, NJ, 1976)."},{"key":"BF02591693_CR3","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1137\/0119011","volume":"19","author":"M. Avriel","year":"1970","unstructured":"M. Avriel and A.C. Williams, \u201cComplementary geometric programming,\u201dSIAM Journal of Applied Mathematics 19 (1970) 125\u2013141.","journal-title":"SIAM Journal of Applied Mathematics"},{"key":"BF02591693_CR4","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1287\/opre.19.1.19","volume":"19","author":"E. Balas","year":"1971","unstructured":"E. Balas, \u201cIntersection cuts\u2014a new type of cutting planes for integer programming,\u201dOperations Research 19 (1971) 19\u201339.","journal-title":"Operations Research"},{"key":"BF02591693_CR5","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1016\/B978-0-12-468650-2.50015-8","volume-title":"Nonlinear Programming","author":"E. Balas","year":"1975","unstructured":"E. Balas, \u201cDisjunctive programming: Cutting planes from logical conditions,\u201d in: O.L. Mangasarian, R.R. Meyer and S.M. Robinson, eds.,Nonlinear Programming (Academic Press, New York, 1975) pp. 279\u2013312."},{"key":"BF02591693_CR6","doi-asserted-by":"crossref","first-page":"549","DOI":"10.1007\/BF00933745","volume":"15","author":"P.P. Bansal","year":"1975","unstructured":"P.P. Bansal and S.E. Jacobsen, \u201cCharacterization of local solutions for a class of nonconvex programs,\u201dJournal of Optimization Theory and Application 15 (1975a) 549\u2013564.","journal-title":"Journal of Optimization Theory and Application"},{"key":"BF02591693_CR7","doi-asserted-by":"crossref","first-page":"565","DOI":"10.1007\/BF00933746","volume":"15","author":"P.P. Bansal","year":"1975","unstructured":"P.P. Bansal and S.E. Jacobsen, \u201cAn algorithm for optimizing network flow capacity under economies of scale,Journal of Optimization Theory and Application 15 (1975b) 565\u2013586.","journal-title":"Journal of Optimization Theory and Application"},{"key":"BF02591693_CR8","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/0305-0548(82)90007-7","volume":"9","author":"J. Bard","year":"1982","unstructured":"J. Bard and J.E. Falk, \u201cAn explicit solution to the multi-level programming problem\u201d,Computers and Operations Research 9 (1982a) 77\u2013100.","journal-title":"Computers and Operations Research"},{"key":"BF02591693_CR9","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1016\/0305-0548(82)90014-4","volume":"9","author":"J. Bard","year":"1982","unstructured":"J. Bard and J.E. Falk, \u201cA separable programming approach to the linear complementarity problem,\u201dComputers and Operations Research 9 (1982b) 153\u2013159.","journal-title":"Computers and Operations Research"},{"key":"BF02591693_CR10","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1016\/0024-3795(68)90052-9","volume":"1","author":"R.W. Cottle","year":"1968","unstructured":"R.W. Cottle and G.B. Dantzig, \u201cComplementary pivot theory of mathematical programming,\u201dLinear Algebra and Applications 1 (1968) 103\u2013125.","journal-title":"Linear Algebra and Applications"},{"key":"BF02591693_CR11","volume-title":"Solution of complementary geometric programming problems","author":"R.S. Dembo","year":"1972","unstructured":"R.S. Dembo, \u201cSolution of complementary geometric programming problems,\u201d M.Sc. Thesis, Technion, Israel Institute of Technology, Haifa (1972)."},{"key":"BF02591693_CR12","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1007\/BF01593787","volume":"12","author":"G. Gallo","year":"1977","unstructured":"G. Gallo and A. Ulkucu, \u201cBilinear programming: An exact algorithm,\u201dMathematical Programming 12 (1977) 173\u2013194.","journal-title":"Mathematical Programming"},{"key":"BF02591693_CR13","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1287\/opre.21.1.123","volume":"21","author":"F. Glover","year":"1973","unstructured":"F. Glover, \u201cConvexity cuts and cut search,\u201dOperations Research 21 (1973) 123\u2013124.","journal-title":"Operations Research"},{"key":"BF02591693_CR14","first-page":"181","volume":"18","author":"F. Glover","year":"1974","unstructured":"F. Glover, \u201cPolyhedral convexity cuts and negative edge extensions,\u201dZeitschrift f\u00fcr Operations Research 18 (1974) 181\u2013186.","journal-title":"Zeitschrift f\u00fcr Operations Research"},{"key":"BF02591693_CR15","doi-asserted-by":"crossref","first-page":"477","DOI":"10.1002\/nav.3800200310","volume":"20","author":"S.A. Gustafson","year":"1973","unstructured":"S.A. Gustafson and K.O. Kortanek, \u201cNumerical solution of a class of semiinfinite programming problems,\u201dNaval Research Logistics Quarterly 20 (1973) 477\u2013504.","journal-title":"Naval Research Logistics Quarterly"},{"key":"BF02591693_CR16","doi-asserted-by":"crossref","first-page":"1091","DOI":"10.1287\/opre.23.6.1091","volume":"23","author":"R.J. Hillestad","year":"1975","unstructured":"R.J. Hillestad, \u201cOptimization problems subject to a budget constraint with economies of scale,\u201dOperations Research 23 (1975) 1091\u20131098.","journal-title":"Operations Research"},{"key":"BF02591693_CR17","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1007\/BF01442883","volume":"6","author":"R.J. Hillestad","year":"1980","unstructured":"R.J. Hillestad and S.E. Jacobsen, \u201cReverse convex programming,\u201dApplied Mathematics and Optimization 6 (1980a) 63\u201378.","journal-title":"Applied Mathematics and Optimization"},{"key":"BF02591693_CR18","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1007\/BF01442898","volume":"6","author":"R.J. Hillestad","year":"1980","unstructured":"R.J. Hillestad and S.E. Jacobsen, \u201cLinear programs with an additional reverse convex constraint,\u201dApplied Mathematics and Optimization 6 (1980b) 257\u2013269.","journal-title":"Applied Mathematics and Optimization"},{"key":"BF02591693_CR19","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1137\/0316005","volume":"16","author":"R.G. Jeroslow","year":"1978","unstructured":"R.G. Jeroslow, \u201cCutting planes for complementarity constraints,\u201dSIAM Journal on Control and Optimization 16 (1978) 56\u201362.","journal-title":"SIAM Journal on Control and Optimization"},{"key":"BF02591693_CR20","doi-asserted-by":"crossref","first-page":"681","DOI":"10.1287\/mnsc.11.7.681","volume":"11","author":"C.E. Lemke","year":"1965","unstructured":"C.E. Lemke, \u201cBimatrix equilibrium points and mathematical programming,\u201dManagement Science 11 (1965) 681\u2013689.","journal-title":"Management Science"},{"key":"BF02591693_CR21","doi-asserted-by":"crossref","first-page":"680","DOI":"10.1287\/opre.17.4.680","volume":"17","author":"M. Raghavachari","year":"1969","unstructured":"M. Raghavachari, \u201cOn the zero-one integer programming problem,\u201dOperations Research 17 (1969) 680\u2013685.","journal-title":"Operations Research"},{"key":"BF02591693_CR22","doi-asserted-by":"crossref","first-page":"581","DOI":"10.1002\/nav.3800310408","volume":"31","author":"B. Ramarao","year":"1984","unstructured":"B. Ramarao and C.M. Shetty, \u201cDevelopment of valid inequalities for disjunctive programming,\u201dNaval Research Logistics Quarterly 31 (1984) 581\u2013600.","journal-title":"Naval Research Logistics Quarterly"},{"key":"BF02591693_CR23","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":"BF02591693_CR24","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1137\/0304021","volume":"4","author":"J.B. Rosen","year":"1966","unstructured":"J.B. Rosen, \u201cIterative solution of nonlinear optimal control problems,\u201dSIAM Journal on Control 4 (1966) 223\u2013244.","journal-title":"SIAM Journal on Control"},{"key":"BF02591693_CR25","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1007\/BF02591860","volume":"31","author":"S. Sen","year":"1985","unstructured":"S. Sen and H.D. Sherali, \u201cOn the convergence of cutting plane algorithms for a class of nonconvex mathematical programs,\u201dMathematical Programming 31 (1985a) 42\u201356.","journal-title":"Mathematical Programming"},{"key":"BF02591693_CR26","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1016\/0166-218X(85)90078-2","volume":"11","author":"S. Sen","year":"1985","unstructured":"S. Sen and H.D. Sherali, \u201cA branch and bound algorithm for extreme point mathematical programming problems,\u201dDiscrete Applied Mathematics 11 (1985b) 265\u2013280.","journal-title":"Discrete Applied Mathematics"},{"key":"BF02591693_CR27","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1007\/BF01582164","volume":"34","author":"S. Sen","year":"1986","unstructured":"S. Sen and H.D. Sherali, \u201cFacet inequalties from simple disjunctions in cutting plane theory,\u201dMathematical Programming 34 (1986) 72\u201383.","journal-title":"Mathematical Programming"},{"key":"BF02591693_CR28","unstructured":"S. Sen and A. Whiteson, \u201cA cone splitting algorithm for reverse convex programming,\u201dProceedings, IEEE Conference on Systems, Man and Cybernetics (Tucson, AZ, 1985) pp. 656\u2013660."},{"key":"BF02591693_CR29","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-48794-1","volume-title":"Optimization with Disjunctive Constraints","author":"H.D. Sherali","year":"1980","unstructured":"H.D. Sherali and C.M. Shetty,Optimization with Disjunctive Constraints (Springer-Verlag, Berlin-Heidelberg-New York, 1980a)."},{"key":"BF02591693_CR30","doi-asserted-by":"crossref","first-page":"453","DOI":"10.1002\/nav.3800270310","volume":"27","author":"H.D. Sherali","year":"1980","unstructured":"H.D. Sherali and C.M. Shetty, \u201cDeep cuts in disjunctive programming,\u201dNaval Research Logistics Quarterly 27 (1980b) 453\u2013357.","journal-title":"Naval Research Logistics Quarterly"},{"key":"BF02591693_CR31","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-46216-0","volume-title":"Convexity and Optimization in Finite Dimensions I","author":"J. Stoer","year":"1970","unstructured":"J. Stoer and C. Witzgall,Convexity and Optimization in Finite Dimensions I (Springer-Verlag, Berlin, 1970)."},{"key":"BF02591693_CR32","volume-title":"Methods for Linear and Quadratic Programming","author":"C. Panne Van de","year":"1974","unstructured":"C. Van de Panne,Methods for Linear and Quadratic Programming (North-Holland, Amsterdam, 1974)."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02591693.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02591693\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02591693","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T19:37:48Z","timestamp":1558381068000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02591693"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987,6]]},"references-count":32,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1987,6]]}},"alternative-id":["BF02591693"],"URL":"https:\/\/doi.org\/10.1007\/bf02591693","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1987,6]]}}}