{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,4]],"date-time":"2026-05-04T10:18:32Z","timestamp":1777889912352,"version":"3.51.4"},"reference-count":30,"publisher":"Elsevier BV","issue":"11","license":[{"start":{"date-parts":[[2001,9,1]],"date-time":"2001-09-01T00:00:00Z","timestamp":999302400000},"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":[[2001,9]]},"DOI":"10.1016\/s0305-0548(00)00025-3","type":"journal-article","created":{"date-parts":[[2002,12,10]],"date-time":"2002-12-10T21:10:39Z","timestamp":1039554639000},"page":"1049-1074","source":"Crossref","is-referenced-by-count":11,"title":["On using exterior penalty approaches for solving linear programming problems"],"prefix":"10.1016","volume":"28","author":[{"given":"Hanif D.","family":"Sherali","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Burak","family":"\u00d6zdaryal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Warren P.","family":"Adams","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Naguib","family":"Attia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0305-0548(00)00025-3_BIB1","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1007\/BF02579150","article-title":"A new polynomial-time algorithm for linear programming","volume":"4","author":"Karmarkar","year":"1984","journal-title":"Combinatorica"},{"key":"10.1016\/S0305-0548(00)00025-3_BIB2","article-title":"On projected Newton barrier methods for linear programming and an equivalence to Karmarkar's projective method","volume":"193\u2013209","author":"Gill","year":"1986","journal-title":"Mathematical Programming"},{"key":"10.1016\/S0305-0548(00)00025-3_BIB3","doi-asserted-by":"crossref","unstructured":"Nesterov YE, Nemirovskii A. Interior-point polynomial algorithms in convex programming. Philadelphia: Society for Industrial and Applied Mathematics, 1994.","DOI":"10.1137\/1.9781611970791"},{"key":"10.1016\/S0305-0548(00)00025-3_BIB4","doi-asserted-by":"crossref","unstructured":"Saigal R. Linear Programming: a modern integrated analysis. Boston: Kluwer Academic Publishers, 1995.","DOI":"10.1007\/978-1-4615-2311-6"},{"key":"10.1016\/S0305-0548(00)00025-3_BIB5","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1016\/0024-3795(91)90275-2","article-title":"Computational experience with a primal\u2013dual interior point method for linear programming","volume":"152","author":"Lustig","year":"1991","journal-title":"Linear Algebra and its Applications"},{"issue":"2","key":"10.1016\/S0305-0548(00)00025-3_BIB6","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1007\/BF02190058","article-title":"Stable exponential-penalty algorithm with superlinear convergence","volume":"83","author":"Cominetti","year":"1994","journal-title":"Journal of Optimization Theory and Applications"},{"key":"10.1016\/S0305-0548(00)00025-3_BIB7","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1007\/BF01586925","article-title":"An infeasible (exterior point) simplex algorithm for assignment problems","volume":"51","author":"Paparrizos","year":"1991","journal-title":"Mathematical Programming"},{"key":"10.1016\/S0305-0548(00)00025-3_BIB8","doi-asserted-by":"crossref","first-page":"497","DOI":"10.1007\/BF02023111","article-title":"An exterior point simplex algorithm for (general) linear programming problems","volume":"47","author":"Paparrizos","year":"1993","journal-title":"Annals of Operations Research"},{"key":"10.1016\/S0305-0548(00)00025-3_BIB9","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1007\/BF01581078","article-title":"Exterior point algorithms for nearest points and convex quadratic programs","volume":"57","author":"Al-Sultan","year":"1992","journal-title":"Mathematical Programming"},{"issue":"4","key":"10.1016\/S0305-0548(00)00025-3_BIB10","first-page":"559","article-title":"An exterior-point polytope sliding and deformation algorithm for linear programming problems","volume":"8","author":"Sherali","year":"1997","journal-title":"Informatica"},{"issue":"1","key":"10.1016\/S0305-0548(00)00025-3_BIB11","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1007\/BF00939949","article-title":"An exterior point method for convex programming problems","volume":"72","author":"Andrus","year":"1992","journal-title":"Journal of Optimization Theory and Applications"},{"issue":"3","key":"10.1016\/S0305-0548(00)00025-3_BIB12","doi-asserted-by":"crossref","first-page":"561","DOI":"10.1007\/BF02190122","article-title":"An exterior-point method for linear programming problems","volume":"91","author":"Andrus","year":"1996","journal-title":"Journal of Optimization Theory and Applications"},{"key":"10.1016\/S0305-0548(00)00025-3_BIB13","unstructured":"Bazaraa MS, Sherali HD, Shetty CM. Nonlinear Programming Theory and Algorithms, 2nd ed. New York: Wiley, 1993."},{"key":"10.1016\/S0305-0548(00)00025-3_BIB14","unstructured":"Fletcher R. Practical Methods of Optimization, 2nd ed. New York: Wiley, 1987."},{"issue":"2","key":"10.1016\/S0305-0548(00)00025-3_BIB15","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1137\/0314017","article-title":"On penalty and multiplier methods for constrained minimization","volume":"14","author":"Bertsekas","year":"1976","journal-title":"SIAM Journal of Control and Optimization"},{"key":"10.1016\/S0305-0548(00)00025-3_BIB16","unstructured":"Bertsekas DP. Nonlinear programming. Belmont: Athena Scientific, 1995."},{"key":"10.1016\/S0305-0548(00)00025-3_BIB17","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1007\/BF00927673","article-title":"Multiplier and gradient methods","volume":"4","author":"Hestenes","year":"1969","journal-title":"Journal of Optimization Theory and Applications"},{"key":"10.1016\/S0305-0548(00)00025-3_BIB18","unstructured":"Powell MJD. A method for nonlinear constraints in minimization problems. In: Fletcher R, editor. Optimization. 1969."},{"issue":"3","key":"10.1016\/S0305-0548(00)00025-3_BIB19","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1007\/BF01580881","article-title":"A class of convergent primal\u2013dual subgradient algorithms for decomposable convex programs","volume":"35","author":"Sen","year":"1986","journal-title":"Mathematical Programming"},{"key":"10.1016\/S0305-0548(00)00025-3_BIB20","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1007\/BF01447654","article-title":"A primal\u2013dual conjugate subgradient algorithm for specially structured linear and convex programming problems","volume":"20","author":"Sherali","year":"1989","journal-title":"Applied Mathematics and Optimization"},{"issue":"3","key":"10.1016\/S0305-0548(00)00025-3_BIB21","doi-asserted-by":"crossref","first-page":"674","DOI":"10.1137\/S1052623493251463","article-title":"Convergence properties of an augmented Lagrangian algorithm for optimization with a combination of general equality and linear constraints","volume":"6","author":"Conn","year":"1996","journal-title":"SIAM Journal of Optimization"},{"issue":"217","key":"10.1016\/S0305-0548(00)00025-3_BIB22","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1090\/S0025-5718-97-00777-1","article-title":"A globally convergent Lagrangian barrier algorithm for optimization with general inequality constraints and simple bounds","volume":"66","author":"Conn","year":"1997","journal-title":"Mathematics of Computation"},{"issue":"2","key":"10.1016\/S0305-0548(00)00025-3_BIB23","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1137\/S1052623493259215","article-title":"Penalty\/barrier multiplier methods for convex programming problems","volume":"7","author":"Ben-Tal","year":"1997","journal-title":"SIAM Journal of Optimization"},{"key":"10.1016\/S0305-0548(00)00025-3_BIB24","unstructured":"Nash SG, Sofer A. Linear and nonlinear programming. New York: McGraw-Hill, 1996."},{"issue":"1","key":"10.1016\/S0305-0548(00)00025-3_BIB25","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1137\/0801008","article-title":"On the solution of large quadratic programming problems with bound constraints","volume":"1","author":"More","year":"1991","journal-title":"SIAM Journal of Optimization"},{"issue":"2","key":"10.1016\/S0305-0548(00)00025-3_BIB26","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1016\/0022-247X(90)90109-S","article-title":"Conjugate gradient methods using quasi-Newton updates with inexact line searches","volume":"150","author":"Sherali","year":"1990","journal-title":"Journal of Mathematical Analysis and Applications"},{"key":"10.1016\/S0305-0548(00)00025-3_BIB27","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1145\/363744.363779","article-title":"Construction of nonlinear programming test problems","volume":"8","author":"Rosen","year":"1965","journal-title":"Communication of ACM"},{"key":"10.1016\/S0305-0548(00)00025-3_BIB28","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/0166-218X(88)90041-8","article-title":"Dual formulations and subgradient optimization strategies for linear programming relaxations of mixed-integer programs","volume":"20","author":"Sherali","year":"1988","journal-title":"Discrete Applied Mathematics"},{"key":"10.1016\/S0305-0548(00)00025-3_BIB29","unstructured":"Ozdaryal B. Exterior penalty approaches for solving linear programming problems. M.S. Thesis, Industrial and Systems Engineering Department, Virginia Polytechnic Institute and State University, Blacksburg, VA, 1999."},{"key":"10.1016\/S0305-0548(00)00025-3_BIB30","unstructured":"Neter J, Wasserman W, Whitmore GA. Applied Statistics, 4th ed. Massachusetts: Allyn and Bacon, 1993."}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054800000253?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054800000253?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,26]],"date-time":"2019-04-26T00:22:05Z","timestamp":1556238125000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054800000253"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,9]]},"references-count":30,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2001,9]]}},"alternative-id":["S0305054800000253"],"URL":"https:\/\/doi.org\/10.1016\/s0305-0548(00)00025-3","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[2001,9]]}}}