{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,14]],"date-time":"2025-07-14T02:50:37Z","timestamp":1752461437428,"version":"3.32.0"},"reference-count":49,"publisher":"Springer Science and Business Media LLC","issue":"1-3","license":[{"start":{"date-parts":[[1995,7,1]],"date-time":"1995-07-01T00:00:00Z","timestamp":804556800000},"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":[[1995,7]]},"DOI":"10.1007\/bf01585552","type":"journal-article","created":{"date-parts":[[2005,4,28]],"date-time":"2005-04-28T08:42:17Z","timestamp":1114677737000},"page":"45-73","source":"Crossref","is-referenced-by-count":18,"title":["A cutting plane method from analytic centers for stochastic programming"],"prefix":"10.1007","volume":"69","author":[{"given":"O.","family":"Bahn","sequence":"first","affiliation":[]},{"given":"O.","family":"du Merle","sequence":"additional","affiliation":[]},{"given":"J. -L.","family":"Goffin","sequence":"additional","affiliation":[]},{"given":"J. -P.","family":"Vial","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"CR1","volume-title":"A scaling technique for finding the weighted analytic center of a polytope","author":"D.S. Atkinson","year":"1992","unstructured":"D.S. Atkinson and P.M. Vaidya, \u201cA scaling technique for finding the weighted analytic center of a polytope,\u201d University of Illinois at Urbana-Champaign, Urbana, IL, 1992."},{"issue":"1","key":"CR2","first-page":"1","volume":"69","author":"D.S. Atkinson","year":"1995","unstructured":"D.S. Atkinson and P.M. Vaidya, \u201cA cutting plane algorithm for convex programming that uses analytic centers,\u201dMathematical Programming 69 (1) (1995) 1\u201343 (this issue).","journal-title":"Mathematical Programming"},{"issue":"1\u20133","key":"CR3","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/0166-218X(94)90198-8","volume":"49","author":"O. Bahn","year":"1994","unstructured":"O. Bahn, J.-L. Goffin, J.-P. Vial and O. du Merle, \u201cExperimental behavior of an interior point cutting plane algorithm for convex programming: an application to geometric programming,\u201dDiscrete Applied Mathematics 49 (1\u20133) (1994) 3\u201323.","journal-title":"Discrete Applied Mathematics"},{"key":"CR4","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1111\/j.2517-6161.1955.tb00191.x","volume":"17","author":"E.M. Beale","year":"1955","unstructured":"E.M. Beale, \u201cOn minimizing a convex function subject to linear inequalities,\u201dJournal of the Royal Statistical Society, Series B 17 (1955) 173\u2013184.","journal-title":"Journal of the Royal Statistical Society, Series B"},{"key":"CR5","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,\u201dNumerische Mathematik 4 (1962) 238\u2013252.","journal-title":"Numerische Mathematik"},{"key":"CR6","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,\u201dComputational Optimization and Applications 1 (1992) 245\u2013276.","journal-title":"Computational Optimization and Applications"},{"key":"CR7","doi-asserted-by":"crossref","first-page":"384","DOI":"10.1016\/0377-2217(88)90159-2","volume":"34","author":"J.R. Birge","year":"1988","unstructured":"J.R. Birge and F.V. Louveaux, \u201cA multicut algorithm for two-stage stochastic linear programs,\u201dEuropean Journal of Operations Research 34 (1988) 384\u2013392.","journal-title":"European Journal of Operations Research"},{"key":"CR8","doi-asserted-by":"crossref","first-page":"1472","DOI":"10.1287\/mnsc.34.12.1472","volume":"34","author":"J.R. Birge","year":"1988","unstructured":"J.R. Birge and L. Qi, \u201cComputing block-angular Karmarkar projections with applications to stochastic programming,\u201dManagement Science 34 (1988) 1472\u20131479.","journal-title":"Management Science"},{"issue":"1","key":"CR9","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/BF01581258","volume":"58","author":"I.C. Choi","year":"1993","unstructured":"I.C. Choi and D. Goldfarb, \u201cExploiting special structure in a primal\u2014dual path-following algorithm,\u201dMathematical Programming 58 (1) (1993) 33\u201352.","journal-title":"Mathematical Programming"},{"key":"CR10","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/0024-3795(74)90066-4","volume":"8","author":"R.W. Cottle","year":"1974","unstructured":"R.W. Cottle, \u201cManifestations of the Schur complement,\u201dLinear Algebra and Applications 8 (1974) 189\u2013211.","journal-title":"Linear Algebra and Applications"},{"key":"CR11","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1287\/mnsc.1.3-4.197","volume":"1","author":"G.B. Dantzig","year":"1955","unstructured":"G.B. Dantzig, \u201cLinear programming under uncertainty,\u201dManagement Science 1 (1955) 197\u2013206.","journal-title":"Management Science"},{"key":"CR12","volume-title":"Linear Programming and Extensions","author":"G.B. Dantzig","year":"1963","unstructured":"G.B. Dantzig,Linear Programming and Extensions (Princeton University Press, Princeton, NJ, 1963)."},{"key":"CR13","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF02186471","volume":"14","author":"G.B. Dantzig","year":"1988","unstructured":"G.B. Dantzig, \u201cPlanning under uncertainty using parallel computing,\u201dAnnals of Operations Research 14 (1988) 1\u201316.","journal-title":"Annals of Operations Research"},{"key":"CR14","first-page":"165","volume-title":"Proceedings of the Fourth Berkeley Symposium on Mathematical Statistics and Probability, Vol. 1","author":"G.B. Dantzig","year":"1961","unstructured":"G.B. Dantzig and A. Madansky, \u201cOn the solution of two-stage linear programs under uncertainty,\u201d in: J. Neyman, ed.,Proceedings of the Fourth Berkeley Symposium on Mathematical Statistics and Probability, Vol. 1 (University of California Press, Berkeley, CA, 1961) pp. 165\u2013176."},{"key":"CR15","doi-asserted-by":"crossref","first-page":"767","DOI":"10.2307\/1911818","volume":"29","author":"G.B. Dantzig","year":"1961","unstructured":"G.B. Dantzig and P. Wolfe, \u201cThe decomposition algorithm for linear programming,\u201dEconometrica 29 (1961) 767\u2013778.","journal-title":"Econometrica"},{"key":"CR16","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1007\/BF01840456","volume":"1","author":"G. Ghellinck de","year":"1986","unstructured":"G. de Ghellinck and J.-P. Vial, \u201cA polynomial Newton method for linear programming,\u201dAlgorithmica 1 (1986) 425\u2013453.","journal-title":"Algorithmica"},{"volume-title":"Stochastic Programming","year":"1980","key":"CR17","unstructured":"M. Dempster, ed.,Stochastic Programming (Academic Press, New York, 1980)."},{"key":"CR18","unstructured":"D. den Hertog, \u201cInterior point approach to linear, quadratic and convex programming: algorithms and complexity,\u201d Ph.D. Thesis, Faculty of Mathematics and Informatics, Technical University Delft, 1992."},{"key":"CR19","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611971811","volume-title":"LINPACK User's Guide","author":"J.J. Dongarra","year":"1979","unstructured":"J.J. Dongarra, C.B. Moler, J.R. Bunch and G.W. Stewart,LINPACK User's Guide (SIAM, Philadelphia, PA, 1979)."},{"key":"CR20","series-title":"Springer Series in Computational Mathematics","volume-title":"Numerical Techniques for Stochastic Optimization","year":"1988","unstructured":"Yu. Ermoliev and R.J.-B. Wets, eds.,Numerical Techniques for Stochastic Optimization, Springer Series in Computational Mathematics 10 (Springer, New York, 1988)."},{"key":"CR21","first-page":"311","volume":"43","author":"L. Escudero","year":"1993","unstructured":"L. Escudero, P.K. Kamesam, A.J. King and R.J.-B. Wets, \u201cProduction planning via scenario modelling,\u201dAnnals of Operations Research 43 (1993) 311\u2013355.","journal-title":"Annals of Operations Research"},{"key":"CR22","doi-asserted-by":"crossref","first-page":"284","DOI":"10.1287\/mnsc.38.2.284","volume":"38","author":"J.-L. Goffin","year":"1992","unstructured":"J.-L. Goffin, A. Haurie and J.-P. Vial, \u201cDecomposition and nondifferentiable optimization with the projective algorithm,\u201dManagement Science 38 (1992) 284\u2013302.","journal-title":"Management Science"},{"key":"CR23","doi-asserted-by":"crossref","unstructured":"J.-L. Goffin, Z.-Q. Luo and Y. Ye, \u201cFurther complexity analysis of a primal-dual column generation algorithm for convex or quasiconvex feasibility problems,\u201d Manuscript, 1993.","DOI":"10.1007\/978-1-4613-3632-7_10"},{"issue":"1","key":"CR24","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1007\/BF01580602","volume":"60","author":"J.-L. Goffin","year":"1993","unstructured":"J.-L. Goffin and J.-P. Vial, \u201cOn the computation of weighted analytic centers and dual ellipsoids with the projective algorithm,\u201dMathematical Programming 60 (1) (1993) 81\u201392.","journal-title":"Mathematical Programming"},{"key":"CR25","doi-asserted-by":"crossref","first-page":"268","DOI":"10.1137\/0801018","volume":"1","author":"C.C. Gonzaga","year":"1991","unstructured":"C.C. Gonzaga, \u201cLarge steps path-following methods for linear programming, Part I: Barrier function method,\u201dSIAM Journal on Optimization 1 (1991) 268\u2013279.","journal-title":"SIAM Journal on Optimization"},{"key":"CR26","doi-asserted-by":"crossref","first-page":"280","DOI":"10.1137\/0801019","volume":"1","author":"C.C. Gonzaga","year":"1991","unstructured":"C.C. Gonzaga, \u201cLarge steps path-following methods for linear programming, Part II: Potential reduction method,\u201dSIAM Journal on Optimization 1 (1991) 280\u2013292.","journal-title":"SIAM Journal on Optimization"},{"key":"CR27","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1137\/1034048","volume":"34","author":"C.C. Gonzaga","year":"1992","unstructured":"C.C. Gonzaga, \u201cPath following methods for linear programming,\u201dSIAM Review 34 (1992) 167\u2013227.","journal-title":"SIAM Review"},{"key":"CR28","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1007\/BF01601939","volume":"30","author":"P. Kall","year":"1979","unstructured":"P. Kall, \u201cComputational methods for solving two-stage stochastic linear programming problems,\u201dZeitschrift f\u00fcr Angewandte Mathematik und Physik 30 (1979) 261\u2013271.","journal-title":"Zeitschrift f\u00fcr Angewandte Mathematik und Physik"},{"key":"CR29","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1007\/BF02579150","volume":"4","author":"N. Karmarkar","year":"1984","unstructured":"N. Karmarkar, \u201cA new polynomial time algorithm for linear programming,\u201dCombinatorica 4 (1984) 373\u2013395.","journal-title":"Combinatorica"},{"key":"CR30","first-page":"703","volume":"8","author":"J.E. Kelley","year":"1960","unstructured":"J.E. Kelley, \u201cThe cutting plane method for solving convex programs,\u201dJournal of the SIAM 8 (1960) 703\u2013712.","journal-title":"Journal of the SIAM"},{"key":"CR31","volume-title":"Optimization Theory for Large Scale Systems","author":"L.S. Lasdon","year":"1970","unstructured":"L.S. Lasdon,Optimization Theory for Large Scale Systems (Macmillan, New York, 1970)."},{"key":"CR32","volume-title":"A revised simplex method for block structured linear programs","author":"E. Loute","year":"1976","unstructured":"E. Loute, \u201cA revised simplex method for block structured linear programs,\u201d Ph.D. Thesis, Universit\u00e9 Catholique de Louvain, Louvain-la-Neuve, 1976."},{"key":"CR33","unstructured":"E. Loute and J.-P. Vial, \u201cA parallelisable block Cholesky factorization for staircase linear programming problems,\u201d Technical Report 1992.15, Department of Management Studies, Facult\u00e9 des S.E.S., University of Geneva, 1992."},{"key":"CR34","doi-asserted-by":"crossref","first-page":"757","DOI":"10.1287\/opre.39.5.757","volume":"39","author":"I.J. Lustig","year":"1991","unstructured":"I.J. Lustig, J.M. Mulvey and T.J. Carpenter, \u201cThe formulation of stochastic programs for interior point methods,\u201dOperations Research 39 (1991) 757\u2013770.","journal-title":"Operations Research"},{"key":"CR35","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1007\/BF02023050","volume":"22","author":"D. Mehdi","year":"1990","unstructured":"D. Mehdi, \u201cParallel bundle-based decomposition for large-scale structured mathematical programming problems,\u201dAnnals of Operations Research 22 (1990) 101\u2013127.","journal-title":"Annals of Operations Research"},{"issue":"3","key":"CR36","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1007\/BF01580902","volume":"56","author":"J.E. Mitchell","year":"1992","unstructured":"J.E. Mitchell and M.J. Todd, \u201cSolving combinatorial optimization problems using Karmarkar's algorithm,\u201dMathematical Programming 56 (3) (1992) 245\u2013284.","journal-title":"Mathematical Programming"},{"issue":"1","key":"CR37","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1007\/s10107-003-0392-8","volume":"69","author":"Yu. Nesterov","year":"1995","unstructured":"Yu. Nesterov, \u201cComplexity estimates of some cutting plane methods based on the analytic barrier,\u201dMathematical Programming 69 (1) (1995) 149\u2013176 (this issue).","journal-title":"Mathematical Programming"},{"key":"CR38","doi-asserted-by":"crossref","unstructured":"A. Pr\u00e9kopa and R.J.-B. Wets, eds.,Stochastic Programming 84: Part I, Mathematical Programming Study 27 (1986).","DOI":"10.1007\/BFb0121110"},{"key":"CR39","doi-asserted-by":"crossref","unstructured":"A. Pr\u00e9kopa and R.J.-B. Wets, eds.,Stochastic Programming 84: Part II, Mathematical Programming Study 28 (1986).","DOI":"10.1007\/BFb0121122"},{"issue":"1","key":"CR40","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1007\/BF01580724","volume":"40","author":"J. Renegar","year":"1988","unstructured":"J. Renegar, \u201cA polynomial-time algorithm based on Newton's method, for linear programming,\u201dMathematical Programming 40 (1) (1988) 59\u201393.","journal-title":"Mathematical Programming"},{"key":"CR41","first-page":"435","volume-title":"Analyse Non Lin\u00e9aire","author":"S.M. Robinson","year":"1989","unstructured":"S.M. Robinson, \u201cBundle-based decomposition: conditions for convergence,\u201d in: H. Attouch, J.-P. Aubin, F. Clarke and I. Ekeland, eds.,Analyse Non Lin\u00e9aire (Gauthier-Villars, Paris, 1989) pp. 435\u2013447."},{"issue":"3","key":"CR42","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1007\/BF01586056","volume":"54","author":"C. Roos","year":"1992","unstructured":"C. Roos and J.-P. Vial, \u201cA polynomial method of approximate centers for linear programming,\u201dMathematical Programming 54 (3) (1992) 295\u2013305.","journal-title":"Mathematical Programming"},{"key":"CR43","series-title":"International Series of Numerical Mathematics","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1007\/978-3-0348-9297-1_20","volume-title":"Trends in Mathematical Optimization","author":"G. Sonnevend","year":"1988","unstructured":"G. Sonnevend, \u201cNew algorithms in convex programming based on a notion of \u2018centre\u2019 (for systems of analytic inequalities) and on rational extrapolation,\u201d in: K.H. Hoffmann, J.B. Hiriat-Urruty, C. Lemarechal and J. Zowe, eds.,Trends in Mathematical Optimization, Proceedings of the Fourth French-German Conference on Optimization, Irsee, 1986, International Series of Numerical Mathematics 84 (Birkh\u00e4user, Basel, 1988) pp. 311\u2013327."},{"key":"CR44","doi-asserted-by":"crossref","first-page":"638","DOI":"10.1137\/0117061","volume":"17","author":"R. Slyke Van","year":"1969","unstructured":"R. Van Slyke and R.J.-B. Wets, \u201cL-shaped linear programs with applications to optimal control and stochastic programming,\u201dSIAM Journal on Applied Mathematics 17 (1969) 638\u2013663.","journal-title":"SIAM Journal on Applied Mathematics"},{"key":"CR45","series-title":"Springer Series in Computational Mathematics","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1007\/978-3-642-61370-8_3","volume-title":"Numerical Techniques for Stochastic Optimization","author":"R.J.-B. Wets","year":"1988","unstructured":"R.J.-B. Wets, \u201cLarge-scale linear programming techniques in stochastic programming,\u201d in: Yu. Ermoliev and R.J.-B. Wets, eds.,Numerical Techniques for Stochastic Optimization, Springer Series in Computational Mathematics 10 (Springer, New York, 1988) pp. 65\u201393."},{"key":"CR46","first-page":"583","volume-title":"Optimization","author":"R.J.-B. Wets","year":"1989","unstructured":"R.J.-B. Wets, \u201cStochastic programming,\u201d in: G.L. Nemhauser, A.H.G. Rinnooy Kan and M.J. Todd, eds.,Optimization (North-Holland, Amsterdam, 1989) pp. 583\u2013629."},{"key":"CR47","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1137\/0802002","volume":"2","author":"Y. Ye","year":"1992","unstructured":"Y. Ye, \u201cA potential reduction algorithm allowing column generation,\u201dSIAM Journal on Optimization 2 (1992) 7\u201320.","journal-title":"SIAM Journal on Optimization"},{"key":"CR48","unstructured":"\u201cCPLEX User's Guide,\u201d CPLEX Optimization, Inc., Incline Village, NV, 1992."},{"key":"CR49","unstructured":"\u201cOptimization Subroutine Library, Guide and Reference,\u201d IBM Corp., Kingston, NY, 1991."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01585552.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01585552\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01585552","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,31]],"date-time":"2024-12-31T23:21:53Z","timestamp":1735687313000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01585552"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,7]]},"references-count":49,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1995,7]]}},"alternative-id":["BF01585552"],"URL":"https:\/\/doi.org\/10.1007\/bf01585552","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"type":"print","value":"0025-5610"},{"type":"electronic","value":"1436-4646"}],"subject":[],"published":{"date-parts":[[1995,7]]}}}