{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,12]],"date-time":"2026-01-12T20:26:34Z","timestamp":1768249594907,"version":"3.49.0"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1981,12,1]],"date-time":"1981-12-01T00:00:00Z","timestamp":376012800000},"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":[[1981,12]]},"DOI":"10.1007\/bf01584248","type":"journal-article","created":{"date-parts":[[2005,4,28]],"date-time":"2005-04-28T08:29:50Z","timestamp":1114676990000},"page":"241-261","source":"Crossref","is-referenced-by-count":68,"title":["An elementary survey of general duality theory in mathematical programming"],"prefix":"10.1007","volume":"21","author":[{"given":"Jorgen","family":"Tind","sequence":"first","affiliation":[]},{"given":"Laurence A.","family":"Wolsey","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1137\/0315022","volume":"15","author":"E.J. Balder","year":"1977","unstructured":"E.J. Balder, \u201cAn extension of duality-stability relations to nonconvex optimization problems\u201d,SIAM Journal on Control and Optimization 15 (1977) 329\u2013343.","journal-title":"SIAM Journal on Control and Optimization"},{"key":"CR2","doi-asserted-by":"crossref","first-page":"238","DOI":"10.1007\/BF01386316","volume":"4","author":"J.F. Benders","year":"1962","unstructured":"J.F. Benders, \u201cPartitioning procedures for solving mixed variables programming problems\u201d,Numerische Mathematik 4 (1962) 238\u2013252.","journal-title":"Numerische Mathematik"},{"key":"CR3","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1016\/0012-365X(77)90028-0","volume":"19","author":"C.E. Blair","year":"1977","unstructured":"C.E. Blair and R.G. Jeroslow, \u201cThe value function of a mixed integer program: I\u201d,Discrete Mathematics 19 (1977), 121\u2013138.","journal-title":"Discrete Mathematics"},{"key":"CR4","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1016\/S0167-5060(08)70730-1","volume":"1","author":"C.A. Burdet","year":"1977","unstructured":"C.A. Burdet and E.L. Johnson, \u201cA subadditive approach to solve linear integer programs\u201d,Annals of Discrete Mathematics 1 (1977) 117\u2013144.","journal-title":"Annals of Discrete Mathematics"},{"key":"CR5","first-page":"5","volume":"7","author":"S. Dolecki","year":"1978","unstructured":"S. Dolecki, \u201cSemicontinuity in constrained optimization. Part I.1. metric spaces\u201d,Control and Cybernetics 7 (1978) 5\u201316.","journal-title":"Control and Cybernetics"},{"key":"CR6","volume-title":"Abstract study of optimality conditions","author":"S. Dolecki","year":"1979","unstructured":"S. Dolecki, \u201cAbstract study of optimality conditions\u201d, Institute of Mathematics, Warsaw. Undated, received May 1979."},{"key":"CR7","unstructured":"S. Dolecki, \u201cAbstract optimality theory\u201d, MRC Technical Report 2006, University of Wisconsin (October 1979)."},{"key":"CR8","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1137\/0316018","volume":"16","author":"S. Dolecki","year":"1978","unstructured":"S. Dolecki and S. Kurcyusz, \u201cOn\u00c6-convexity in extremal problems\u201d,SIAM Journal on Control and Optimization 16 (1978) 277\u2013300.","journal-title":"SIAM Journal on Control and Optimization"},{"key":"CR9","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1080\/02331887408801144","volume":"5","author":"K.H. Elster","year":"1974","unstructured":"K.H. Elster and R. Nehse, \u201cZur Theorie der Polarfunktionale\u201d,Mathematische Operationsforschung und Statistik 5 (1974) 3\u201321.","journal-title":"Mathematische Operationsforschung und Statistik"},{"key":"CR10","doi-asserted-by":"crossref","first-page":"1079","DOI":"10.1287\/opre.19.4.1079","volume":"19","author":"J.P. Evans","year":"1971","unstructured":"J.P. Evans, F.J. Gould and S.M. Howe, \u201cA note on extended GLM\u201d,Operations Research 19 (1971) 1079\u20131080.","journal-title":"Operations Research"},{"key":"CR11","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1287\/opre.11.3.399","volume":"11","author":"H. Everett","year":"1963","unstructured":"H. Everett, \u201cGeneralized Lagrange multiplier method for solving problems of optimum allocation of resources\u201d,Operations Research 11 (1963) 399\u2013417.","journal-title":"Operations Research"},{"key":"CR12","doi-asserted-by":"crossref","first-page":"73","DOI":"10.4153\/CJM-1949-007-x","volume":"1","author":"W. Fenchel","year":"1949","unstructured":"W. Fenchel, \u201cOn conjugate convex functions,Canadian Journal of Mathematics 1 (1949) 73\u201377.","journal-title":"Canadian Journal of Mathematics"},{"key":"CR13","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1137\/1013001","volume":"13","author":"A.M. Geoffrion","year":"1971","unstructured":"A.M. Geoffrion, \u201cDuality in nonlinear programming: A simplified applications-oriented development\u201d,SIAM Review 13 (1971) 1\u201337.","journal-title":"SIAM Review"},{"key":"CR14","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1007\/BFb0120699","volume":"3","author":"A.M. Geoffrion","year":"1975","unstructured":"A.M. Geoffrion, \u201cLagrangean relaxation for integer programming\u201d,Mathematical Programming Study 3 (1975) 56\u201394.","journal-title":"Mathematical Programming Study"},{"key":"CR15","doi-asserted-by":"crossref","first-page":"1280","DOI":"10.1137\/0117120","volume":"17","author":"F.J. Gould","year":"1969","unstructured":"F.J. Gould, \u201cExtensions of Lagrange multipliers in nonlinear programming\u201d,SIAM Journal on Applied Mathematics 17 (1969) 1280\u20131297.","journal-title":"SIAM Journal on Applied Mathematics"},{"key":"CR16","first-page":"196","volume":"14","author":"F.J. Gould","year":"1972","unstructured":"F.J. Gould, \u201cNonlinear duality theorems\u201d,Cahiers du Centre d'Etudes de Recherche Op\u00e9rationnelle 14 (1972) 196\u2013212.","journal-title":"Cahiers du Centre d'Etudes de Recherche Op\u00e9rationnelle"},{"key":"CR17","doi-asserted-by":"crossref","first-page":"924","DOI":"10.1287\/opre.18.5.924","volume":"18","author":"H.J. Greenberg","year":"1970","unstructured":"H.J. Greenberg and W.P. Pierskalla, \u201cSurrogate mathematical programming\u201d,Operations Research 18 (1970) 924\u2013939.","journal-title":"Operations Research"},{"key":"CR18","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1016\/0012-365X(78)90112-7","volume":"23","author":"R.G. Jeroslow","year":"1978","unstructured":"R.G. Jeroslow, \u201cCutting plane theory: Algebraic methods\u201d,Discrete Mathematics 23 (1978) 121\u2013150.","journal-title":"Discrete Mathematics"},{"key":"CR19","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01588222","volume":"17","author":"R.G. Jeroslow","year":"1979","unstructured":"R.G. Jeroslow, \u201cMinimal inequalities\u201d,Mathematical Programming 17 (1979) 1\u201315.","journal-title":"Mathematical Programming"},{"key":"CR20","volume-title":"Mathematical Programming","author":"E.L. Johnson","year":"1973","unstructured":"E.L. Johnson, \u201cCyclic groups, cutting planes and shortest paths\u201d, in: T.C. Hu and S. Robinson, eds.,Mathematical Programming (Academic Press, New York, 1973)."},{"key":"CR21","first-page":"289","volume":"XIX","author":"E.L. Johnson","year":"1976","unstructured":"E.L. Johnson, \u201cFaces of polyhedra of mixed integer programming problems\u201d, Istituto Nazionale di alta Matematica XIX (1976) 289\u2013299.","journal-title":"Istituto Nazionale di alta Matematica"},{"key":"CR22","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/S0167-5060(08)70345-5","volume":"5","author":"E.L. Johnson","year":"1979","unstructured":"E.L. Johnson, \u201cOn the group problem and a subadditive approach to integer programming\u201d,Annals of Discrete Mathematics 5 (1979) 97\u2013112.","journal-title":"Annals of Discrete Mathematics"},{"key":"CR23","doi-asserted-by":"crossref","first-page":"212","DOI":"10.1007\/BF01580392","volume":"11","author":"T.C. Koopmans","year":"1976","unstructured":"T.C. Koopmans, \u201cConcepts of optimality and their uses\u201d, Nobel Memorial Lecture, December 1975, in:Mathematical Programming 11 (1976) 212\u2013228.","journal-title":"Mathematical Programming"},{"key":"CR24","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":"CR25","doi-asserted-by":"crossref","first-page":"268","DOI":"10.1137\/0312021","volume":"12","author":"R.T. Rockafellar","year":"1974","unstructured":"R.T. Rockafellar, \u201cAugmented Lagrange multiplier functions and duality in nonconvex programming\u201d,SIAM Journal on Control 12 (1974) 268\u2013283.","journal-title":"SIAM Journal on Control"},{"key":"CR26","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":"CR27","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1007\/BF01589344","volume":"20","author":"L.A. Wolsey","year":"1981","unstructured":"L.A. Wolsey, \u201cInteger programming duality: Price functions and sensitivity analysis\u201d,Mathematical Programming 20 (1981) 173\u2013195.","journal-title":"Mathematical Programming"},{"key":"CR28","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1007\/BFb0120913","volume":"13","author":"L.A. Wolsey","year":"1980","unstructured":"L.A. Wolsey, \u201cHeuristic analysis, linear programming and branch and bound\u201d,Mathematical Programming Study 13 (1980) 121\u2013134.","journal-title":"Mathematical Programming Study"},{"key":"CR29","doi-asserted-by":"crossref","first-page":"244","DOI":"10.1007\/BFb0120932","volume":"14","author":"L.A. Wolsey","year":"1981","unstructured":"L.A. Wolsey, \u201cDecomposition algorithms for general mathematical programs\u201d,Mathematical Programming Study 14 (1981) 244\u2013257.","journal-title":"Mathematical Programming Study"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01584248.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01584248\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01584248","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T15:29:28Z","timestamp":1556897368000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01584248"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1981,12]]},"references-count":29,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1981,12]]}},"alternative-id":["BF01584248"],"URL":"https:\/\/doi.org\/10.1007\/bf01584248","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1981,12]]}}}