{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,13]],"date-time":"2025-07-13T03:40:03Z","timestamp":1752378003708,"version":"3.41.2"},"reference-count":46,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1998,2,1]],"date-time":"1998-02-01T00:00:00Z","timestamp":886291200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1998,2,1]],"date-time":"1998-02-01T00:00:00Z","timestamp":886291200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computational Optimization and Applications"],"published-print":{"date-parts":[[1998,2]]},"DOI":"10.1023\/a:1018343420495","type":"journal-article","created":{"date-parts":[[2003,2,6]],"date-time":"2003-02-06T17:08:17Z","timestamp":1044551297000},"page":"107-152","source":"Crossref","is-referenced-by-count":3,"title":["A Constant-Potential Infeasible-Start Interior-Point Algorithm with Computational Experiments and Applications"],"prefix":"10.1007","volume":"9","author":[{"given":"Abbas","family":"Seifi","sequence":"first","affiliation":[]},{"given":"Levent","family":"Tun\u00e7el","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"160024_CR1","series-title":"Technical Report","volume-title":"Potential reduction algorithms","author":"K.M. Anstreicher","year":"1996","unstructured":"K.M. Anstreicher, \u201cPotential reduction algorithms,\u201d Technical Report, Department of Management Sciences, University of Iowa, Iowa City, IA, 1996 (to appear in Interior Point Methods, T. Terlaky, ed.)."},{"key":"160024_CR2","doi-asserted-by":"crossref","first-page":"989","DOI":"10.1287\/opre.33.5.989","volume":"33","author":"J.R. Birge","year":"1985","unstructured":"J.R. Birge, \u201cDecomposition and partitioning methods for multistage stochastic linear programs,\u201d Operations Research, vol. 33, pp. 989\u20131007, 1985.","journal-title":"Operations Research"},{"key":"160024_CR3","first-page":"1","volume":"17","author":"J.R. Birge","year":"1987","unstructured":"J.R. Birge, M.A.H. Dempster, H.I. Gassmann, E.A. Gunn, A.J. King, and S.W. Wallace, \u201cA standard input format for multi-period stochastic linear programs,\u201d Committee on Algorithms Newsletter of the Mathematical Programming Society, vol. 17, pp. 1\u201319, 1987.","journal-title":"A standard input format for multi-period stochastic linear programs"},{"key":"160024_CR4","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1007\/BF00249637","volume":"1","author":"J.R. Birge","year":"1992","unstructured":"J.R. Birge and D.F. Holmes, \u201cEfficient solution of two-stage stochastic linear programs using interior-point methods,\u201d Computational Optimization and Applications, vol. 1, pp. 245\u2013276, 1992.","journal-title":"Computational Optimization and Applications"},{"key":"160024_CR5","doi-asserted-by":"crossref","unstructured":"J. Czyzyk, R. Fourer and S. Mehrotra, \u201cA study of the Augmented system and column-splitting approaches for solving two-stage stochastic linear programs by interior-point methods,\u201d ORSA Journal on Computing, pp. 474\u2013490, Fall 1995.","DOI":"10.1287\/ijoc.7.4.474"},{"key":"160024_CR6","volume-title":"A workshop on resource planning under uncertainty for electric power systems","author":"G. Dantzig","year":"1989","unstructured":"G. Dantzig and P.W. Glynn, \u201cA workshop on resource planning under uncertainty for electric power systems,\u201d Department of Operations Research, Stanford University, Stanford, California, January 21-22, 1989."},{"key":"160024_CR7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF02023045","volume":"22","author":"G. Dantzig","year":"1990","unstructured":"G. Dantzig and P.W. Glynn, \u201cParallel processors for planning under uncertainty,\u201d Annals of Operations Research, vol. 22, pp. 1\u201321, 1990.","journal-title":"Annals of Operations Research"},{"key":"160024_CR8","first-page":"165","volume-title":"Proc. of the Fourth Berkeley Symposium on Mathematics and Probability","author":"G. Dantzig","year":"1961","unstructured":"G. Dantzig and A. Madansky, \u201cOn the solution of two stage programs under uncertainty,\u201d in Proc. of the Fourth Berkeley Symposium on Mathematics and Probability, vol. 1, University of California Press, Berkeley, California, 1961, pp. 165\u2013176."},{"key":"160024_CR9","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1007\/BF01585158","volume":"62","author":"R. Fourer","year":"1993","unstructured":"R. Fourer and S. Mehrotra, \u201cSolving symmetric indefinite systems in an interior point method for linear programming,\u201d Mathematical Programming, vol. 62, pp. 15\u201339, 1993.","journal-title":"Mathematical Programming"},{"key":"160024_CR10","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1007\/BF02206810","volume":"62","author":"R. M. Freund","year":"1996","unstructured":"R. M. Freund, \u201cAn infeasible-start algorithm for linear programming whose complexity depends on the distance from the starting point to the optimal solution,\u201d Annals of Operations Research 62, pp. 29\u201358, 1996.","journal-title":"Annals of Operations Research"},{"key":"160024_CR11","volume-title":"Multi-period stochastic programming","author":"H.I. Gassmann","year":"1987","unstructured":"H.I. Gassmann, \u201dMulti-period stochastic programming,\u201d Ph.D. Thesis, The Faculty of Commerce and Business Administration, The University of British Columbia, Vancouver, British Columbia, 1987."},{"key":"160024_CR12","doi-asserted-by":"crossref","first-page":"849","DOI":"10.1088\/0266-5611\/8\/6\/005","volume":"8","author":"P. C. Hansen","year":"1992","unstructured":"P. C. Hansen, \u201cNumerical tools for analysis and solution of Fredholm integral equations of the first kind,\u201d Inverse Problems, vol. 8, pp. 849\u2013872, 1992.","journal-title":"Inverse Problems"},{"key":"160024_CR13","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1007\/BF02579150","volume":"4","author":"N. Karmarkar","year":"1984","unstructured":"N. Karmarkar, \u201cA polynomial time algorithm for linear programming,\u201d Combinatorica, vol. 4, pp. 373\u2013395, 1984.","journal-title":"Combinatorica"},{"key":"160024_CR14","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF02206809","volume":"62","author":"M. Kojima","year":"1996","unstructured":"M. Kojima, \u201cBasic lemmas in polynomial-time infeasible-interior-point methods for linear programs,\u201d Annals of Operations Research, vol. 62, pp. 1\u201328, 1996.","journal-title":"Annals of Operations Research"},{"key":"160024_CR15","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1007\/BF01582151","volume":"61","author":"M. Kojima","year":"1993","unstructured":"M. Kojima, N. Megiddo and S. Mizuno, \u201cA primal-dual infeasible-interior-point algorithm for linear programming,\u201d Mathematical Programming, vol. 61, pp. 263\u2013280, 1993.","journal-title":"Mathematical Programming"},{"key":"160024_CR16","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01587074","volume":"44","author":"M. Kojima","year":"1989","unstructured":"M. Kojima, S. Mizuno and A. Yoshise, \u201cA polynomial time algorithm for a class of linear complementarity problems,\u201d Mathematical Programming, vol. 44, pp. 1\u201326, 1989.","journal-title":"Mathematical Programming"},{"key":"160024_CR17","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1007\/BF01581689","volume":"65","author":"M. Kojima","year":"1994","unstructured":"M. Kojima, T. Noma and A. Yoshise, \u201cGlobal convergence in infeasible-interior-point algorithms,\u201d Mathematical Programming, vol. 65, pp. 43\u201372, 1994.","journal-title":"Mathematical Programming"},{"key":"160024_CR18","doi-asserted-by":"crossref","first-page":"435","DOI":"10.1137\/0802022","volume":"2","author":"I.J. Lustig","year":"1992","unstructured":"I.J. Lustig, R.E. Marsten and D.F. Shanno, \u201cOn implementing Mehrotra's predictor-corrector interior point method for linear programming,\u201d SIAM Journal on Optimization, vol. 2, pp. 435\u2013449, 1992.","journal-title":"SIAM Journal on Optimization"},{"key":"160024_CR19","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1007\/BF01581140","volume":"66","author":"I.J. Lustig","year":"1994","unstructured":"I.J. Lustig, R.E. Marsten and D.F. Shanno, \u201cComputational experience with a globally convergent primal-dual predictor-corrector algorithm for linear programming,\u201d Mathematical Programming, vol. 66, pp. 123\u2013135, 1994.","journal-title":"Mathematical Programming"},{"key":"160024_CR20","first-page":"131","volume-title":"Progress in Mathematical Programming","author":"N. Megiddo","year":"1988","unstructured":"N. Megiddo, \u201cPathways to the optimal set in linear programming,\u201d in Progress in Mathematical Programming (N. Megiddo, ed.), Springer-Verlag, New York, 1988, pp. 131\u2013158."},{"key":"160024_CR21","doi-asserted-by":"crossref","first-page":"575","DOI":"10.1137\/0802028","volume":"2","author":"S. Mehrotra","year":"1992","unstructured":"S. Mehrotra, \u201cOn the implementation of a primal-dual interior point method,\u201d SIAM Journal on Optimization, vol. 2, pp. 575\u2013601, 1992.","journal-title":"SIAM Journal on Optimization"},{"key":"160024_CR22","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/BF01582216","volume":"67","author":"S. Mizuno","year":"1994","unstructured":"S. Mizuno, \u201cPolynomiality of infeasible interior-point algorithms for linear programming,\u201d Mathematical Programming, vol. 67, pp. 109\u2013121, 1994.","journal-title":"Mathematical Programming"},{"key":"160024_CR23","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1137\/0805003","volume":"5","author":"S. Mizuno","year":"1995","unstructured":"S. Mizuno, M. Kojima, and M.J. Todd, \u201cInfeasible-interior-point primal-dual potential-reduction algorithms for linear programming,\u201d SIAM Journal on Optimization, vol. 5, pp. 52\u201367, 1995.","journal-title":"SIAM Journal on Optimization"},{"key":"160024_CR24","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1137\/0806001","volume":"6","author":"R.D.C. Monteiro","year":"1996","unstructured":"R.D.C. Monteiro and S.J. Wright, \u201cA superlinear infeasible-interior-point affine scaling algorithm for LCP,\u201d SIAM Journal on Optimization, vol. 6, pp. 1\u201318, 1996.","journal-title":"SIAM Journal on Optimization"},{"key":"160024_CR25","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1007\/BF02204860","volume":"31","author":"J.M. Mulvey","year":"1991","unstructured":"J.M. Mulvey and H. Vladimirou, \u201cApplying the progressive hedging algorithm to stochastic generalized networks,\u201d Annals of Operations Research, vol. 31, pp. 399\u2013424, 1991.","journal-title":"Annals of Operations Research"},{"key":"160024_CR26","unstructured":"Y. Nesterov, Private Communication, CORE: Belgium, 1994."},{"key":"160024_CR27","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1287\/moor.16.1.119","volume":"16","author":"R.T. Rockafellar","year":"1991","unstructured":"R.T. Rockafellar and R.J.-B. Wets, \u201cScenarios and policy aggregation in optimization under uncertainty,\u201d Mathematics of Operations Research, vol. 16, pp. 119\u2013147, 1991.","journal-title":"Mathematics of Operations Research"},{"key":"160024_CR28","volume-title":"A constant-potential infeasible-interior-point algorithm with application to stochastic linear programming","author":"A. Seifi","year":"1996","unstructured":"A. Seifi, \u201dA constant-potential infeasible-interior-point algorithm with application to stochastic linear programming,\u201d Ph.D. Thesis, Department of Systems Design Engineering, University of Waterloo, Waterloo, Ontario, 1996."},{"key":"160024_CR29","series-title":"Technical Report","volume-title":"Potential-reduction methods in mathematical programming","author":"M.J. Todd","year":"1996","unstructured":"M.J. Todd, \u201cPotential-reduction methods in mathematical programming,\u201d Technical Report 1112, School of Operations Research and Industrial Engineering, Cornell University, Ithaca, NY, 1996 (to appear in Mathematical Programming Series B)."},{"key":"160024_CR30","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1007\/BF01581142","volume":"66","author":"L. Tun\u00e7el","year":"1994","unstructured":"L. Tun\u00e7el, \u201cConstant potential primal-dual algorithms: A framework,\u201d Mathematical Programming, vol. 66, pp. 145\u2013159, 1994.","journal-title":"Mathematical Programming"},{"key":"160024_CR31","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1007\/BF01302893","volume":"4","author":"L. Tun\u00e7el","year":"1995","unstructured":"L. Tun\u00e7el, \u201cOn the convergence of primal-dual interior-point methods,\u201d Computational Optimization and Applications, vol. 4, pp. 139\u2013158, 1995.","journal-title":"Computational Optimization and Applications"},{"key":"160024_CR32","series-title":"Technical Report","volume-title":"An infeasible-interior-point potential-reduction algorithm for linear programming","author":"R. T\u00fct\u00fcnc\u00fc","year":"1996","unstructured":"R. T\u00fct\u00fcnc\u00fc, \u201cAn infeasible-interior-point potential-reduction algorithm for linear programming,\u201d, Technical Report 1136, School of Operations Research and Industrial Engineering, Cornell University, Ithaca, NY, 1996."},{"key":"160024_CR33","doi-asserted-by":"crossref","first-page":"638","DOI":"10.1137\/0117061","volume":"17","author":"R. Van Slyke","year":"1969","unstructured":"R. Van Slyke and R. Wets, \u201cL-shaped linear programs with application to optimal control and stochastic programming,\u201d SIAM Journal on Applied Mathematics, vol. 17, pp. 638\u2013663, 1969.","journal-title":"SIAM Journal on Applied Mathematics"},{"key":"160024_CR34","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1287\/ijoc.5.2.134","volume":"5","author":"R. Vanderbei","year":"1993","unstructured":"R. Vanderbei, \u201cALPO: Another Linear Program Optimizer,\u201d ORSA Journal on Computing, vol. 5, pp. 134\u2013146, 1993.","journal-title":"ORSA Journal on Computing"},{"key":"160024_CR35","volume-title":"LOQO: An interior point code for quadratic programming, Program in Statistics and Operations Research","author":"R.J. Vanderbei","year":"1994","unstructured":"R.J. Vanderbei, LOQO: An interior point code for quadratic programming, Program in Statistics and Operations Research, Princeton University: Princeton, NJ, 1994."},{"key":"160024_CR36","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01581257","volume":"58","author":"R.J. Vanderbei","year":"1993","unstructured":"R.J. Vanderbei and T.J. Carpenter, \u201cSymmetric indefinite systems for interior-point methods,\u201d Mathematical Programming, vol. 58, pp. 1\u201332, 1993.","journal-title":"Mathematical Programming"},{"key":"160024_CR37","doi-asserted-by":"crossref","first-page":"1143","DOI":"10.1137\/0114091","volume":"14","author":"R.J-B Wets","year":"1966","unstructured":"R.J-B Wets, \u201cProgramming under uncertainty: the solution set,\u201d SIAM Journal on Applied Mathematics, vol. 14, pp. 1143\u20131151, 1966.","journal-title":"SIAM Journal on Applied Mathematics"},{"key":"160024_CR38","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1080\/17442508308833274","volume":"10","author":"R.J-B Wets","year":"1983","unstructured":"R.J-B Wets, \u201cSolving stochastic programs with simple recourse,\u201d Stochastics, vol. 10, pp. 219\u2013242, 1983.","journal-title":"Stochastics"},{"key":"160024_CR39","volume-title":"Numerical Techniques for Stochastic Optimization","author":"R.J-B Wets","year":"1988","unstructured":"R.J-B Wets, \u201cLarge scale linear programming techniques,\u201d in Numerical Techniques for Stochastic Optimization (Y. S. Ermoliev and R.J-B Wets, eds.), Springer-Verlag: New York, 1988."},{"key":"160024_CR40","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1287\/moor.19.1.53","volume":"19","author":"Y. Ye","year":"1994","unstructured":"Y. Ye, M. J. Todd and S. Mizuno, \u201cAn O(\u221anL)-iteration homogeneous and self-dual linear programming,\u201d Mathematics of Operations Research, vol. 19, pp. 53\u201367, 1994.","journal-title":"Mathematics of Operations Research"},{"key":"160024_CR41","doi-asserted-by":"crossref","first-page":"1797","DOI":"10.1029\/WR021i012p01797","volume":"21","author":"W. W. Yeh","year":"1985","unstructured":"W. W-G. Yeh, \u201cReservoir management and operations models: a state-of-the-art review,\u201d Water Resources Research, vol. 21, pp. 1797\u20131818, 1985.","journal-title":"Water Resources Research"},{"key":"160024_CR42","doi-asserted-by":"crossref","first-page":"208","DOI":"10.1137\/0804012","volume":"4","author":"Y. Zhang","year":"1994","unstructured":"Y. Zhang, \u201cOn the convergence of infeasible interior-point algorithms for the horizontal linear complementarity problem,\u201d SIAM Journal on Optimization, vol. 4, pp. 208\u2013227, 1994.","journal-title":"SIAM Journal on Optimization"},{"key":"160024_CR43","doi-asserted-by":"crossref","first-page":"304","DOI":"10.1137\/0802015","volume":"2","author":"Y. Zhang","year":"1992","unstructured":"Y. Zhang, R.A. Tapia and J.E. Dennis, \u201cOn the superlinear and quadratic convergence of primal-dual interior-point linear programming algorithms,\u201d SIAM Journal on Optimization, vol. 2, pp. 304\u2013324, 1992.","journal-title":"SIAM Journal on Optimization"},{"key":"160024_CR44","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1007\/BF01585769","volume":"68","author":"Y. Zhang","year":"1995","unstructured":"Y. Zhang and D. Zhang, \u201cOn polynomiality of the Mehrotra-type predictor-corrector interior-point algorithms,\u201d Mathematical Programming, vol. 68, pp. 303\u2013318, 1995.","journal-title":"Mathematical Programming"},{"key":"160024_CR45","unstructured":"\u201cCPLEX User's Guide,\u201d CPLEX Optimization, Inc., Suite 279, Incline Village, NV, USA (http:\/\/www.cplex.com)."},{"key":"160024_CR46","volume-title":"LIPSOL: a MATLAB Toolkit for Linear Programming","author":"Y. Zhang","year":"1995","unstructured":"Y. Zhang, \u201cLIPSOL: a MATLAB Toolkit for Linear Programming,\u201d Department of Mathematics and Statistics, University of Maryland, Baltimore, Maryland, 1995 (available via WWW URL: http:\/\/math.umbc.edu\/~yzhang)."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1018343420495.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1018343420495\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1018343420495.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,13]],"date-time":"2025-07-13T03:11:37Z","timestamp":1752376297000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1018343420495"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,2]]},"references-count":46,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1998,2]]}},"alternative-id":["160024"],"URL":"https:\/\/doi.org\/10.1023\/a:1018343420495","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"type":"print","value":"0926-6003"},{"type":"electronic","value":"1573-2894"}],"subject":[],"published":{"date-parts":[[1998,2]]}}}