{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,30]],"date-time":"2026-06-30T23:30:00Z","timestamp":1782862200471,"version":"3.54.5"},"reference-count":54,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2002,7,1]],"date-time":"2002-07-01T00:00:00Z","timestamp":1025481600000},"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":["European Journal of Operational Research"],"published-print":{"date-parts":[[2002,7]]},"DOI":"10.1016\/s0377-2217(02)00061-9","type":"journal-article","created":{"date-parts":[[2002,10,11]],"date-time":"2002-10-11T14:39:25Z","timestamp":1034347165000},"page":"170-190","source":"Crossref","is-referenced-by-count":41,"title":["Pivot versus interior point methods: Pros and cons"],"prefix":"10.1016","volume":"140","author":[{"given":"Tibor","family":"Ill\u00e9s","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Tam\u00e1s","family":"Terlaky","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(02)00061-9_BIB1","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1007\/BF01758841","article-title":"A geometric view of parametric linear programming","volume":"8","author":"Adler","year":"1992","journal-title":"Algorithmica"},{"key":"10.1016\/S0377-2217(02)00061-9_BIB2","series-title":"High Performance Optimization","first-page":"197","article-title":"The MOSEK interior point optimizer for linear programming: An implementation of the homogeneous algorithm","author":"Andersen","year":"1999"},{"key":"10.1016\/S0377-2217(02)00061-9_BIB3","series-title":"Interior Point Methods of Mathematical Programming","first-page":"189","article-title":"Implementation of interior point methods for large scale linear programming","author":"Andersen","year":"1996"},{"key":"10.1016\/S0377-2217(02)00061-9_BIB4","series-title":"Nonlinear Programming: Theory and Algorithms","author":"Bazaraa","year":"1993"},{"key":"10.1016\/S0377-2217(02)00061-9_BIB5","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1002\/nav.3800020406","article-title":"Cycling in the dual simplex algorithm","volume":"2","author":"Beale","year":"1955","journal-title":"Naval Research Logistics Quarterly"},{"key":"10.1016\/S0377-2217(02)00061-9_BIB6","unstructured":"A. Ben-Tal, A. Nemirovskii, Convex Optimization in Engineering: Modeling, Analysis, Algorithms, SIAM, Philadelphia, PA, 2001"},{"issue":"1","key":"10.1016\/S0377-2217(02)00061-9_BIB7","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1287\/ijoc.6.1.15","article-title":"Progress in linear programming","volume":"6","author":"Bixby","year":"1994","journal-title":"ORSA Journal on Computing"},{"key":"10.1016\/S0377-2217(02)00061-9_BIB8","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1287\/moor.2.2.103","article-title":"New finite pivoting rules for the simplex method","volume":"2","author":"Bland","year":"1977","journal-title":"Mathematics of Operation Research"},{"key":"10.1016\/S0377-2217(02)00061-9_BIB9","series-title":"The Simplex Method: A Probabilistic Analysis","author":"Borgwardt","year":"1987"},{"key":"10.1016\/S0377-2217(02)00061-9_BIB10","doi-asserted-by":"crossref","first-page":"160","DOI":"10.2307\/1907845","article-title":"Optimality and degenerancy in linear programming","volume":"20","author":"Charnes","year":"1952","journal-title":"Econometrica"},{"key":"10.1016\/S0377-2217(02)00061-9_BIB11","unstructured":"J. Clausen, A tutorial note on the complexity of the simplex algorithm, Technical Report NR 79\/16, DIKU, University of Copenhagen, Copenhagen, Denmark, 1979"},{"key":"10.1016\/S0377-2217(02)00061-9_BIB12","series-title":"Linear Programming and Extensions","author":"Dantzig","year":"1963"},{"key":"10.1016\/S0377-2217(02)00061-9_BIB13","doi-asserted-by":"crossref","first-page":"183","DOI":"10.2140\/pjm.1955.5.183","article-title":"The generalized simplex method for minimizing a linear inequality constraints","volume":"5","author":"Dantzig","year":"1955","journal-title":"Pacific Journal of Mathematics"},{"key":"10.1016\/S0377-2217(02)00061-9_BIB14","first-page":"457","article-title":"A Fourier-f\u00e9le mechanikai elv alkalmaz\u00e1sai (English title: Applications of Fourier's mechanical principle)","volume":"12","author":"Farkas","year":"1894","journal-title":"Mathematikai \u00e9s Term\u00e9szettudom\u00e1nyi \u00c9rtes\u0131\u0301t\u0151"},{"key":"10.1016\/S0377-2217(02)00061-9_BIB15","series-title":"Nonlinear Programming: Sequential Unconstrained Minimization Techniques","author":"Fiacco","year":"1968"},{"key":"10.1016\/S0377-2217(02)00061-9_BIB16","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1147\/sj.311.0011","article-title":"Implementing the simplex method for the optimization sub-routine library","volume":"31","author":"Forrest","year":"1992","journal-title":"IBM Systems Journal"},{"key":"10.1016\/S0377-2217(02)00061-9_BIB17","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1111\/j.1475-3995.1997.tb00083.x","article-title":"The existence of a short sequence of admissible pivots to an optimal basis in LP and LCP","volume":"4","author":"Fukuda","year":"1997","journal-title":"International Transactions on Operations Research"},{"key":"10.1016\/S0377-2217(02)00061-9_BIB18","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/0377-2217(91)90343-T","article-title":"On the finiteness of the criss-cross method","volume":"52","author":"Fukuda","year":"1991","journal-title":"European Journal of Operations Research"},{"key":"10.1016\/S0377-2217(02)00061-9_BIB19","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1007\/BF02614325","article-title":"Criss-cross methods: A fresh view on pivot algorithms","volume":"79","author":"Fukuda","year":"1997","journal-title":"Mathematical Programming"},{"issue":"4","key":"10.1016\/S0377-2217(02)00061-9_BIB20","first-page":"431","article-title":"On the existence of short admissible pivot sequences","volume":"10","author":"Fukuda","year":"2000","journal-title":"PUMA: Mathematics of Optimization"},{"key":"10.1016\/S0377-2217(02)00061-9_BIB21","doi-asserted-by":"crossref","first-page":"437","DOI":"10.1007\/BF01589114","article-title":"A practical anti-cycling procedure for linearly constrained optimization","volume":"45","author":"Gill","year":"1989","journal-title":"Mathematical Programming"},{"key":"10.1016\/S0377-2217(02)00061-9_BIB22","doi-asserted-by":"crossref","first-page":"1115","DOI":"10.1145\/227683.227684","article-title":"Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming","volume":"42","author":"Goemans","year":"1995","journal-title":"Journal of ACM"},{"key":"10.1016\/S0377-2217(02)00061-9_BIB23","unstructured":"D. Goldfarb, J.J.H. Forrest, Steepest edge simplex algorithm for linear programming, IBM Research Report, T.J. Watson Research Center, Yorktown Heights, NY, June 1991"},{"key":"10.1016\/S0377-2217(02)00061-9_BIB24","series-title":"Linear Inequalities and Related Systems","first-page":"53","article-title":"Theory of linear programming","volume":"vol. 38","author":"Goldman","year":"1956"},{"key":"10.1016\/S0377-2217(02)00061-9_BIB25","unstructured":"A.J. Hoffman, Cycling in the Simplex Algorithm, National Bureau of Standards Report 2974, Washington, DC, December 1953"},{"key":"10.1016\/S0377-2217(02)00061-9_BIB26","first-page":"15","article-title":"A new and constructive proof of two basic results of linear programming","volume":"11","author":"Ill\u00e9s","year":"2001","journal-title":"Yugoslav Journal of Operations Research"},{"key":"10.1016\/S0377-2217(02)00061-9_BIB27","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/S0377-2217(96)00172-5","article-title":"Sensitivity analysis in linear programming: Just be careful!","volume":"101","author":"Jansen","year":"1997","journal-title":"European Journal of Operations Research"},{"key":"10.1016\/S0377-2217(02)00061-9_BIB28","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\/S0377-2217(02)00061-9_BIB29","first-page":"191","article-title":"A polynomial time algorithm in linear programming","volume":"20","author":"Khacijan","year":"1979","journal-title":"Soviet Mathematics Doklady"},{"key":"10.1016\/S0377-2217(02)00061-9_BIB30","series-title":"Inequalities III","article-title":"How good is the simplex algorithm?","author":"Klee","year":"1972"},{"issue":"3","key":"10.1016\/S0377-2217(02)00061-9_BIB31","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1016\/S0925-5273(99)00036-5","article-title":"The difference between the managerial and mathematical interpretation of sensitivity analysis results in linear programming","volume":"65","author":"Koltai","year":"2000","journal-title":"International Journal on Production Economics"},{"key":"10.1016\/S0377-2217(02)00061-9_BIB32","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1002\/nav.3800010107","article-title":"The dual method of solving the linear programming problem","volume":"1","author":"Lemke","year":"1954","journal-title":"Naval Research Logistics Quarterly"},{"key":"10.1016\/S0377-2217(02)00061-9_BIB33","series-title":"History of Mathematical Programming: A Collection of Personal Reminiscences","year":"1991"},{"issue":"1","key":"10.1016\/S0377-2217(02)00061-9_BIB34","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/ijoc.6.1.1","article-title":"Interior point methods for linear programming: Computational state of the art","volume":"6","author":"Lustig","year":"1994","journal-title":"ORSA Journal on Computing"},{"key":"10.1016\/S0377-2217(02)00061-9_BIB35","series-title":"Advances in Linear and Integer Programming","article-title":"Simplex algorithms","author":"Maros","year":"1996"},{"key":"10.1016\/S0377-2217(02)00061-9_BIB36","series-title":"Linear Programming","author":"Murty","year":"1983"},{"key":"10.1016\/S0377-2217(02)00061-9_BIB37","series-title":"Operations Research: Deterministic Optimization Models","author":"Murty","year":"1995"},{"key":"10.1016\/S0377-2217(02)00061-9_BIB38","unstructured":"J.L. Nazareth, Computer Solution of Linear Programs, 1987"},{"key":"10.1016\/S0377-2217(02)00061-9_BIB39","article-title":"Interior point polynomial algorithms in convex programming","volume":"vol. 13","author":"Nesterov","year":"1994"},{"key":"10.1016\/S0377-2217(02)00061-9_BIB40","doi-asserted-by":"crossref","unstructured":"J. Peng, C. Roo, T. Terlaky, A new class of polynomial primal\u2013dual method for linear and semidefinite optimization, European Journal of Operations Research, to appear 2002, TR December 1999, Advanced Optimization Laboratory, McMaster University, Hamilton, Ont., Canada. Available from http:\/\/www.cas.mcmaster.ca\/oplab\/publications.html","DOI":"10.1016\/S0377-2217(02)00275-8"},{"key":"10.1016\/S0377-2217(02)00061-9_BIB41","unstructured":"J. Peng, C. Roo, T. Terlaky, Self-regular proximities and new search directions for linear and semidefinite optimization, Mathematical Programming, to appear 2002, TR March 2000, Advanced Optimization Laboratory, McMaster University, Hamilton, Ont., Canada. Available from http:\/\/www.cas.mcmaster.ca\/\u223coplab\/publication\/report\/2000-7.ps"},{"key":"10.1016\/S0377-2217(02)00061-9_BIB42","doi-asserted-by":"crossref","first-page":"527","DOI":"10.2307\/2321417","article-title":"On the development of optimization","volume":"87","author":"Pr\u00e9kopa","year":"1980","journal-title":"American Mathematical Monthly"},{"key":"10.1016\/S0377-2217(02)00061-9_BIB43","series-title":"Theory and Algorithms for Linear Optimization: An Interior Point Approach","author":"Roos","year":"1997"},{"key":"10.1016\/S0377-2217(02)00061-9_BIB44","series-title":"System Modelling and Optimization: Proceedings of the 12th IFIP-Conference held in Budapest, Hungary, September 1985","first-page":"866","article-title":"An \u201canalytic center\u201d for polyhedrons and new class of global algorithms for linear (smooth, convex) programming","volume":"vol. 84","author":"Sonnevend","year":"1986"},{"key":"10.1016\/S0377-2217(02)00061-9_BIB45","first-page":"683","article-title":"A convergent criss-cross method","volume":"16","author":"Terlaky","year":"1985","journal-title":"Mathematics of Operationsforschung und Statistics, Ser. Optimization"},{"issue":"1","key":"10.1016\/S0377-2217(02)00061-9_BIB46","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0377-2217(00)00094-1","article-title":"An easy way to teach interior point methods","volume":"130","author":"Terlaky","year":"2000","journal-title":"European Journal of Operations Research"},{"key":"10.1016\/S0377-2217(02)00061-9_BIB47","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1007\/BF02096264","article-title":"Pivot rules for linear programming: A survey on recent theoretical developments","volume":"46","author":"Terlaky","year":"1993","journal-title":"Annals of Operations Research"},{"key":"10.1016\/S0377-2217(02)00061-9_BIB48","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1002\/nav.3800050306","article-title":"The dual simplex algorithm for bounded variables","volume":"5","author":"Wagner","year":"1958","journal-title":"Naval Research Logistics Quarterly"},{"key":"10.1016\/S0377-2217(02)00061-9_BIB49","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/BF02055188","article-title":"Approaches to sensitivity analysis in linear programming","volume":"27","author":"Ward","year":"1990","journal-title":"Annals of Operations Research"},{"key":"10.1016\/S0377-2217(02)00061-9_BIB50","first-page":"205","article-title":"A technique for resolving degeneracy in linear programming","volume":"11","author":"Wolfe","year":"1963","journal-title":"Journal of SIAM"},{"key":"10.1016\/S0377-2217(02)00061-9_BIB51","unstructured":"M.H. Wright, The interior-point revolution in constrained optimization, Numerical Analysis Manuscript 98-4-09, AT & T Bell Lab's, Murray Hill, NJ, 1998"},{"key":"10.1016\/S0377-2217(02)00061-9_BIB52","series-title":"Primal\u2013Dual Interior-Point Methods","author":"Wright","year":"1996"},{"issue":"3","key":"10.1016\/S0377-2217(02)00061-9_BIB53","doi-asserted-by":"crossref","first-page":"607","DOI":"10.1016\/S0377-2217(98)00026-5","article-title":"A new variant of criss-cross pivot algorithm for linear programming","volume":"116","author":"Zhang","year":"1999","journal-title":"European Journal of Operations Research"},{"key":"10.1016\/S0377-2217(02)00061-9_BIB54","series-title":"Interior Point Algorithms","author":"Ye","year":"1997"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221702000619?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221702000619?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,7]],"date-time":"2020-01-07T19:02:43Z","timestamp":1578423763000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221702000619"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,7]]},"references-count":54,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2002,7]]}},"alternative-id":["S0377221702000619"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(02)00061-9","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2002,7]]}}}