{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T07:48:16Z","timestamp":1775807296457,"version":"3.50.1"},"reference-count":35,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1982,1,1]],"date-time":"1982-01-01T00:00:00Z","timestamp":378691200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computers & Operations Research"],"published-print":{"date-parts":[[1982,1]]},"DOI":"10.1016\/0305-0548(82)90007-7","type":"journal-article","created":{"date-parts":[[2003,6,30]],"date-time":"2003-06-30T12:15:45Z","timestamp":1056975345000},"page":"77-100","source":"Crossref","is-referenced-by-count":405,"title":["An explicit solution to the multi-level programming problem"],"prefix":"10.1016","volume":"9","author":[{"given":"Jonathan F.","family":"Bard","sequence":"first","affiliation":[]},{"given":"James E.","family":"Falk","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"3","key":"10.1016\/0305-0548(82)90007-7_BIB1","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1007\/BF01580247","article-title":"Computational experience in sensitivity analysis for nonlinear programming","volume":"6","author":"Armacost","year":"1974","journal-title":"Math. Prog."},{"issue":"1","key":"10.1016\/0305-0548(82)90007-7_BIB2","first-page":"72","article-title":"An algorithm for finding all vertices of a convex polyhedral set","volume":"9","author":"Balinski","year":"1961","journal-title":"SIAM J."},{"key":"10.1016\/0305-0548(82)90007-7_BIB3","article-title":"The application of nonconvex programming techniques to the equilibrium and the multi-level programming problems","author":"Bard","year":"1979"},{"key":"10.1016\/0305-0548(82)90007-7_BIB4","article-title":"Computing equilibrium via nonconvex programming","author":"Bard","year":"1978"},{"key":"10.1016\/0305-0548(82)90007-7_BIB5","series-title":"Proceedings of the Fifth International Conference on Operations Research","first-page":"447","article-title":"Special facilities in a general mathematical programming system for nonconvex problems using ordered sets of variables","author":"Beale","year":"1970"},{"issue":"2","key":"10.1016\/0305-0548(82)90007-7_BIB6","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1007\/BF00934096","article-title":"Infinitely constrained optimization problems","volume":"19","author":"Blankenship","year":"1976","journal-title":"J. Optim. Theory Applics"},{"key":"10.1016\/0305-0548(82)90007-7_BIB7","series-title":"Computer program for solving mathematical programs with nonlinear programs in the constraints","author":"Bracken","year":"1972"},{"issue":"1","key":"10.1016\/0305-0548(82)90007-7_BIB8","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1287\/opre.21.1.37","article-title":"Mathematical programs with optimization problems in the constraints","volume":"21","author":"Bracken","year":"1973","journal-title":"Ops Res."},{"key":"10.1016\/0305-0548(82)90007-7_BIB9","doi-asserted-by":"crossref","first-page":"968","DOI":"10.1287\/opre.25.6.968","article-title":"A strategic weapons exchange allocation model","volume":"25","author":"Bracken","year":"1977","journal-title":"Ops Res."},{"issue":"4","key":"10.1016\/0305-0548(82)90007-7_BIB10","doi-asserted-by":"crossref","first-page":"665","DOI":"10.1137\/0114054","article-title":"The Lagrange multiplier theorem for max-min with several constraints","volume":"14","author":"Bram","year":"1966","journal-title":"J. SIAM Appl. Math."},{"key":"10.1016\/0305-0548(82)90007-7_BIB11","series-title":"Variations on a cutting plane method for solving concave minimization problems with linear constraints","author":"Cabot","year":"1972"},{"key":"10.1016\/0305-0548(82)90007-7_BIB12","series-title":"A linear multi-level programming problem","author":"Candler","year":"1978"},{"issue":"4","key":"10.1016\/0305-0548(82)90007-7_BIB13","doi-asserted-by":"crossref","first-page":"641","DOI":"10.1137\/0114053","article-title":"The theory of max-min with applications","volume":"14","author":"Danskin","year":"1966","journal-title":"J. SIAM Appl. Math."},{"key":"10.1016\/0305-0548(82)90007-7_BIB14","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1002\/nav.3800120303","article-title":"The kernel of a comparative game","volume":"12","author":"Davis","year":"1965","journal-title":"Naval Res. Logist. Quart."},{"key":"10.1016\/0305-0548(82)90007-7_BIB15","article-title":"The application of formulas for nonlinear factorable programming to the solution of implicitly defined optimization problems","author":"de Silva","year":"1978"},{"key":"10.1016\/0305-0548(82)90007-7_BIB16","doi-asserted-by":"crossref","first-page":"612","DOI":"10.1287\/mnsc.17.9.612","article-title":"The linear complementarity problem","volume":"17","author":"Eaves","year":"1971","journal-title":"Mgnt Sci."},{"key":"10.1016\/0305-0548(82)90007-7_BIB17","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1287\/opre.18.1.107","article-title":"Stability in nonlinear programming","volume":"18","author":"Evans","year":"1970","journal-title":"Ops Res."},{"key":"10.1016\/0305-0548(82)90007-7_BIB18","article-title":"An algorithm for locating approximate global solutions of nonconvex, separable problems","author":"Falk","year":"1972"},{"key":"10.1016\/0305-0548(82)90007-7_BIB19","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/BF01580119","article-title":"A linear max-min problem","volume":"5","author":"Falk","year":"1973","journal-title":"Math. Prog."},{"key":"10.1016\/0305-0548(82)90007-7_BIB20","doi-asserted-by":"crossref","first-page":"550","DOI":"10.1287\/mnsc.15.9.550","article-title":"An algorithm for separable nonconvex programming problems","volume":"15","author":"Falk","year":"1969","journal-title":"Mgmt Sci."},{"issue":"3","key":"10.1016\/0305-0548(82)90007-7_BIB21","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1007\/BF01580677","article-title":"Sensitivity analysis for nonlinear programming using penalty methods","volume":"10","author":"Fiacco","year":"1976","journal-title":"Math. Prog."},{"key":"10.1016\/0305-0548(82)90007-7_BIB22","series-title":"Nonlinear programming: Sequential Unconstrained Minimization Techniques","author":"Fiacco","year":"1968"},{"key":"10.1016\/0305-0548(82)90007-7_BIB23","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1007\/BF01593787","article-title":"Bilinear programming: An exact algorithm","volume":"12","author":"Gallo","year":"1977","journal-title":"Math. Prog."},{"key":"10.1016\/0305-0548(82)90007-7_BIB24","series-title":"Program MOGG\u2014A code for solving separable nonconvex optimization problems","author":"Grotte","year":"1976"},{"key":"10.1016\/0305-0548(82)90007-7_BIB25","article-title":"Bilinear programming: Part II. Applications of bilinear programming","author":"Konno","year":"1971"},{"key":"10.1016\/0305-0548(82)90007-7_BIB26","doi-asserted-by":"crossref","first-page":"681","DOI":"10.1287\/mnsc.11.7.681","article-title":"Bimatrix equilibrium points and mathematical programming","volume":"11","author":"Lemke","year":"1965","journal-title":"Mgmt Sci."},{"issue":"2","key":"10.1016\/0305-0548(82)90007-7_BIB27","first-page":"413","article-title":"Equilibrium points of bimatrix games","volume":"12","author":"Lemke","year":"1964","journal-title":"J. SIAM"},{"key":"10.1016\/0305-0548(82)90007-7_BIB28","series-title":"Games and Decisions","author":"Luce","year":"1957"},{"key":"10.1016\/0305-0548(82)90007-7_BIB29","article-title":"Characterization of linear complementarity problems as linear programs","author":"Mangasarian","year":"1976"},{"key":"10.1016\/0305-0548(82)90007-7_BIB30","series-title":"Recent Advances in Mathematical Programming","first-page":"89","article-title":"The simplex method for local separable programming","author":"Miller","year":"1963"},{"key":"10.1016\/0305-0548(82)90007-7_BIB31","doi-asserted-by":"crossref","first-page":"286","DOI":"10.2307\/1969529","article-title":"Non-cooperative games","volume":"54","author":"Nash","year":"1951","journal-title":"Ann. Math."},{"key":"10.1016\/0305-0548(82)90007-7_BIB32","series-title":"Game Theory","author":"Owen","year":"1968"},{"issue":"3","key":"10.1016\/0305-0548(82)90007-7_BIB33","doi-asserted-by":"crossref","first-page":"683","DOI":"10.1016\/0022-247X(77)90255-4","article-title":"Necessary conditions and sufficient conditions for static min-max problems","volume":"57","author":"Schmitendorf","year":"1977","journal-title":"J. Math. Anal. and Appl."},{"key":"10.1016\/0305-0548(82)90007-7_BIB34","doi-asserted-by":"crossref","unstructured":"A. W. Tucker, Solving a matrix game by linear programming. IBM J. Res. Develop. 4(5) 507\u2013517.","DOI":"10.1147\/rd.45.0507"},{"key":"10.1016\/0305-0548(82)90007-7_BIB35","first-page":"1437","article-title":"Concave programming under linear constraints","volume":"4","author":"Tui","year":"1964","journal-title":"Soviet Math. Dokl."}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0305054882900077?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0305054882900077?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,18]],"date-time":"2019-03-18T12:28:53Z","timestamp":1552912133000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0305054882900077"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1982,1]]},"references-count":35,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1982,1]]}},"alternative-id":["0305054882900077"],"URL":"https:\/\/doi.org\/10.1016\/0305-0548(82)90007-7","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[1982,1]]}}}