{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:15:33Z","timestamp":1763468133780},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2013,2,21]],"date-time":"2013-02-21T00:00:00Z","timestamp":1361404800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2014,6]]},"DOI":"10.1007\/s10107-013-0644-1","type":"journal-article","created":{"date-parts":[[2013,2,20]],"date-time":"2013-02-20T03:48:52Z","timestamp":1361332132000},"page":"179-198","source":"Crossref","is-referenced-by-count":3,"title":["Optimality conditions for maximizing a function over a polyhedron"],"prefix":"10.1007","volume":"145","author":[{"given":"William W.","family":"Hager","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"James T.","family":"Hungerford","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,2,21]]},"reference":[{"key":"644_CR1","volume-title":"Nonlinear Programming","author":"DP Bertsekas","year":"1999","unstructured":"Bertsekas, D.P.: Nonlinear Programming. Athena Scientific, Belmont (1999)"},{"key":"644_CR2","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1080\/01630568208816135","volume":"5","author":"J Borwein","year":"1982","unstructured":"Borwein, J.: Necessary and sufficient conditions for quadratic minimality. Numer. Funct. Anal. Optim. 5, 127\u2013140 (1982)","journal-title":"Numer. Funct. Anal. Optim."},{"key":"644_CR3","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1007\/BF01396705","volume":"34","author":"L Contesse","year":"1980","unstructured":"Contesse, L.: Une caract\u00e9risation compl\u00e8te des minima locaux en programmation quadratique. Numer. Math. 34, 315\u2013332 (1980)","journal-title":"Numer. Math."},{"key":"644_CR4","unstructured":"Dantzig, G.: Maximization of a linear function of variables subject to linear inequalities. In: Koopman, T.C. (eds), Activity Analysis of Production and Allocation, Cowles Commission Monograph, vol. 13, Chap. XXI. Wiley, New York (1951)"},{"key":"644_CR5","doi-asserted-by":"crossref","first-page":"246","DOI":"10.1137\/0406019","volume":"6","author":"P Gritzmann","year":"1993","unstructured":"Gritzmann, P., Sturmfels, B.: Minkowski addition of polytopes: computational complexity and applications to Gr\u00f6bner bases. SIAM J. Disc. Math. 6, 246\u2013269 (1993)","journal-title":"SIAM J. Disc. Math."},{"key":"644_CR6","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898717730","volume-title":"Linear and Nonlinear Optimization","author":"I Griva","year":"2009","unstructured":"Griva, I., Nash, S.G., Sofer, A.: Linear and Nonlinear Optimization. SIAM, Philadelphia (2009)"},{"key":"644_CR7","unstructured":"Hager, W.W., Hungerford, J.T.: A Continuous Quadratic Programming Formulation of the Vertex Separator Problem. Technical Report. Department of Mathematics, University of Florida. http:\/\/www.math.ufl.edu\/~hager\/papers\/GP\/vertex.pdf (2012)"},{"key":"644_CR8","doi-asserted-by":"crossref","first-page":"500","DOI":"10.1137\/S0895480199335829","volume":"12","author":"WW Hager","year":"1999","unstructured":"Hager, W.W., Krylyuk, Y.: Graph partitioning and continuous quadratic programming. SIAM J. Disc. Math. 12, 500\u2013523 (1999)","journal-title":"SIAM J. Disc. Math."},{"key":"644_CR9","doi-asserted-by":"crossref","first-page":"540","DOI":"10.1287\/moor.21.3.540","volume":"21","author":"F Hwang","year":"1996","unstructured":"Hwang, F., Rothblum, U.: Directional-quasi-convexity, asymmetric Schur-convexity and optimality of consecutive partitions. Math. Oper. Res. 21, 540\u2013554 (1996)","journal-title":"Math. Oper. Res."},{"key":"644_CR10","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1007\/BF02559569","volume":"102","author":"V Klee","year":"1959","unstructured":"Klee, V.: Some characterizations of convex polyhedra. Acta Math. 102, 79\u2013107 (1959)","journal-title":"Acta Math."},{"key":"644_CR11","doi-asserted-by":"crossref","DOI":"10.1007\/978-0-387-74503-9","volume-title":"Linear and Nonlinear Programming","author":"DG Luenberger","year":"2008","unstructured":"Luenberger, D.G., Ye, Y.: Linear and Nonlinear Programming. Springer, Berlin (2008)"},{"key":"644_CR12","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1007\/BF02592948","volume":"39","author":"KG Murty","year":"1987","unstructured":"Murty, K.G., Kabadi, S.N.: Some NP-complete problems in quadratic and linear programming. Math. Program. 39, 117\u2013129 (1987)","journal-title":"Math. Program."},{"key":"644_CR13","doi-asserted-by":"crossref","DOI":"10.1007\/b98874","volume-title":"Numerical Optimization","author":"J Nocedal","year":"1999","unstructured":"Nocedal, J., Wright, S.J.: Numerical Optimization. Springer, New York (1999)"},{"key":"644_CR14","doi-asserted-by":"crossref","first-page":"549","DOI":"10.1007\/s00454-004-1138-y","volume":"32","author":"S Onn","year":"2004","unstructured":"Onn, S., Rothblum, U.: Convex combinatorial optimization. Discret. Comput. Geom. 32, 549\u2013566 (2004)","journal-title":"Discret. Comput. Geom."},{"key":"644_CR15","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/s10898-004-4313-z","volume":"33","author":"S Onn","year":"2005","unstructured":"Onn, S., Rothblum, U., Tangir, Y.: Edge-directions of standard polyhedra with applications to network flows. J. Glob. Optim. 33, 109\u2013122 (2005)","journal-title":"J. Glob. Optim."},{"key":"644_CR16","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1016\/0167-6377(88)90049-1","volume":"7","author":"PM Pardalos","year":"1988","unstructured":"Pardalos, P.M., Schnitger, G.: Checking local optimality in constrained quadratic programming can be NP-hard. Oper. Res. Lett. 7, 33\u201335 (1988)","journal-title":"Oper. Res. Lett."},{"key":"644_CR17","volume-title":"Network Flows and Monotropic Optimization","author":"RT Rockafellar","year":"1984","unstructured":"Rockafellar, R.T.: Network Flows and Monotropic Optimization. Wiley, New York (1984)"},{"key":"644_CR18","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1007\/BF02283701","volume":"25","author":"F Tardella","year":"1990","unstructured":"Tardella, F.: On the equivalence between some discrete and continuous optimization problems. Ann. Oper. Res. 25, 291\u2013300 (1990)","journal-title":"Ann. Oper. Res."},{"key":"644_CR19","first-page":"1439","volume":"5","author":"H Tuy","year":"1964","unstructured":"Tuy, H.: Concave programming under linear constraints. Soviet Math. 5, 1439\u20131440 (1964)","journal-title":"Soviet Math."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-013-0644-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-013-0644-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-013-0644-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,9]],"date-time":"2019-07-09T22:58:06Z","timestamp":1562713086000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-013-0644-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,2,21]]},"references-count":19,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2014,6]]}},"alternative-id":["644"],"URL":"https:\/\/doi.org\/10.1007\/s10107-013-0644-1","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,2,21]]}}}