Abstract
We discuss interior point methods for large-scale linear programming, with an emphasis on methods that are useful for problems arising in telecommunications. We give the basic framework of a primal-dual interior point method, and consider the numerical issues involved in calculating the search direction in each iteration, including the use of factorization methods and/or preconditioned conjugate gradient methods. We also look at interior point column generation methods which can be used for very large scale linear programs or for problems where the data is generated only as needed.
Keywords
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Bibliography
E. D. Andersen and K. D. Andersen. Presolving in linear programming. Mathematical Programming, 71:221–245, 1996.
E. D. Andersen, J. Gondzio, C. Mészáros, and X. Xu. Implementation of interior point methods for large scale linear programming. In T. Terlaky, editor, Interior Point Methods in Mathematical Programming, chapter 6, pages 189–252. Kluwer Academic Publishers, 1996.
A. Atamtürk. On capacitated network design cut-set polyhedra. Mathematical Programming, 92(3):425–452, 2004.
F. Barahona. Network design using cut inequalities. SIAM Journal on Optimization, 6:823–837, 1996.
A. Ben-Tal and A. Nemirovski. Robust optimization — methodology and applications. Mathematical Programming, 92(3):453–480, 2003.
D. Bienstock and G. Muratore. Strong inequalities for capacitated survivable network design problems. Mathematical Programming, 89(1): 127–147, 2000.
J. R. Birge and F. Louveaux. Introduction to Stochastic Programming. Springer, New York, 1997.
R. E. Bixby, J. W. Gregory, I. J. Lustig, R. E. Marsten, and D. F. Shanno. Very large-scale linear programming: a case study in combining interior point and simplex methods. Operations Research, 40:885–897, 1992.
J. Castro. A specialized interior point algorithm for multicommodity flows. SIAM Journal on Optimization, 10(3):852–877, 2000.
J. Castro and A. Frangioni. A parallel implementation of an interior-point algorithm for multicommodity network flows. In Vector and Parallel Processing VEC-PAR 2000, volume 1981 of Lecture Notes in Computer Science, pages 301–315. Springer-Verlag, 2001.
P. Chardaire and A. Lisser. Simplex and interior point specialized algorithms for solving nonoriented multicommodity flow problems. Operations Research, 50(2):260–276, 2002.
I. C. Choi and D. Goldfarb. Solving multicommodity network flow problems by an interior point method. In T. F. Coleman and Y. Li, editors, Large-Scale Numerical Optimization, pages 58–69. SIAM, Philadelphia, PA, 1990.
G. Dahl and M. Stoer. A cutting plane algorithm for multicommodity survivable network design problems. INFORMS Journal on Computing, 10:1–11, 1998.
J. W. Demmel. Applied Numerical Linear Algebra. SIAM, Philadelphia, PA, 1997.
A. Eisenblätter. Frequency Assignment in GSM Networks: Models, Heuristics, and Lower Bounds. PhD thesis, TU-Berlin and Konrad-Zuse-Zentrum für Informationstechnik, Berlin, 2001.
A. S. El-Bakry, R. A. Tapia, and Y. Zhang. A study of indicators for identifying zero variables in interior-point methods. SIAM Review, 36:45–72, 1994.
S. Elhedhli and J.-L. Goffin. The integration of interior-point cutting plane methods within branch-and-price algorithms. Mathematical Programming, 100(2):267–294, 2004.
A. Forsgren, P. E. Gill, and M. H. Wright. Interior methods for nonlinear optimization. SIAM Review, 44(4):525–597, 2002.
J.-L. Goffin, J. Gondzio, R. Sarkissian, and J.-P. Vial. Solving nonlinear multicommodity network flow problems by the analytic center cutting plane method. Mathematical Programming, 76:131–154, 1997.
J.-L. Goffin and J.-P. Vial. Convex nondifferentiable optimization: a survey focussed on the analytic center cutting plane method. Optimization Methods and Software, 17(5):805–867, 2002.
J. Gondzio and R. Kouwenberg. High-performance computing for asset-liability management. Operations Research, 49(6):879–891, 2001.
M. Grötschel, C. L. Monma, and M. Stoer. Computational results with a cutting plane algorithm for designing communication networks with low-connectivity constraints. Operations Research, 40(2):309–330, 1992.
M. Grötschel, C. L. Monma, and M. Stoer. Polyhedral and computational investigations for designing communication networks with high survivability requirements. Operations Research, 43(6): 1012–1024, 1995.
J. J. Júdice, J. M. Patrício, L. F. Portugal, M. G. C. Resende, and G. Veiga. A study of preconditioners for network interior point methods. Computational Optimization and Applications, 24:5–35, 2003.
J. J. Júdice, L. F. Portugal, M. G. C. Resende, and G. Veiga. A truncated interior point method for the solution of minimum cost flow problems on an undirected multi-commodity network. In Proceedings of the First Portuguese National Telecommunications Conference, pages 381–384, 1997. In Portuguese.
P. Kall and S. W. Wallace. Stochastic Programming. John Wiley, Chichester, UK, 1994. Available online from the authors’ webpages.
A. P. Kamath and O. Palmon. Improved interior point algorithms for exact and approximate solution of multi-commodity flow problems. In Proceedings of the Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 502–511, January 1995.
S. Kapoor and P. Vaidya. Fast algorithms for convex programming and multicommodity flows. Proceedings of the 18th annual ACM symposium on the theory of computing, pages 147–159, 1988.
S. Kapoor and P. Vaidya. Speeding up Karmarkar’s algorithm for multicommodity flows. Mathematical Programming, 73:111–127, 1996.
A. Lisser and F. Rendl. Graph partitioning using linear and semidefinite programming. Mathematical Programming, 95(1):91–101, 2003.
M. S. Lobo, L. Vandenberghe, S. Boyd, and H. Lebret. Applications of second-order cone programming. Linear Algebra and its Applications, 284(1–3): 193–228, 1998.
N. Megiddo. On finding primal-and dual-optimal bases. ORSA Journal on Computing, 3:63–65, 1991.
S. Mehrotra. On the implementation of a primal-dual interior point method. SIAM Journal on Optimization, 2(4):575–601, 1992.
S. Mehrotra and J.-S. Wang. Conjugate gradient based implementation of interior point methods for network flow problems. In L. Adams and J. L. Nazareth, editors, Linear and nonlinear conjugate gradient-related methods, pages 124–142. AMS/SIAM, 1996.
J. E. Mitchell. Computational experience with an interior point cutting plane algorithm. SIAM Journal on Optimization, 10(4): 1212–1227, 2000.
J. E. Mitchell. Polynomial interior point cutting plane methods. Optimization Methods and Software, 18(5):507–534, 2003.
J. E. Mitchell and B. Borchers. Solving linear ordering problems with a combined interior point/simplex cutting plane algorithm. In H. L. Frenk et al., editor, High Performance Optimization, chapter 14, pages 349–366. Kluwer Academic Publishers, Dordrecht, The Netherlands, 2000.
J. E. Mitchell, P. M. Pardalos, and M. G. C. Resende. Interior point methods for combinatorial optimization. In D.-Z. Du and P. M. Pardalos, editors, Handbook of Combinatorial Optimization, volume 1, pages 189–297. Kluwer Academic Publishers, 1998.
J. E. Mitchell and M. J. Todd. Solving combinatorial optimization problems using Karmarkar’s algorithm. Mathematical Programming, 56:245–284, 1992.
Y.-S. Myung, H.-J. Kim, and D.-W. Tcha. Design of cummunication networks with survivability constraints. Management Science, 45(2):238–252, 1999.
J. Patrício, L. F. Portugal, M. G. C. Resende, G. Veiga, and J. J. Júdice. Fortran subroutines for network flow optimization using an interior point algorithm. Technical Report TD-5X2SLN, AT&T Labs, Florham Park, NJ, March 2004.
L. Portugal, M. Resende, G. Veiga, and J. Júdice. A truncated primal-infeasible dual-feasible network interior point method. Networks, 35:91–108, 2000.
S. Raghavan and T. L. Magnanti. Network connectivity. In M. Dell’Amico, F. Maffioli, and S. Martello, editors, Annotated bibliographies in combinatorial optimization, pages 335–354. John Wiley, Chichester, 1997.
M. G. C. Resende and G. Veiga. An efficient implementation of a network interior point method. In D.S. Johnson and C.C. McGeogh, editors, Network Flows and Matching: First DIMACS Implementation Challenge,, pages 299–348. American Mathematical Society, 1993a. DIMACS Series on Discrete Mathematics and Theoretical Computer Science, vol. 12.
M. G. C. Resende and G. Veiga. An implementation of the dual affine scaling algorithm for minimum cost flow on bipartite uncapacitated networks. SIAM Journal on Optimization, 3:516–537, 1993b.
M. G. C. Resende and G. Veiga. An annotated bibliography of network interior point methods. Networks, 42:114–121, 2003.
C. Roos, T. Terlaky, and J.-Ph. Vial. Theory and Algorithms for Linear Optimization: An Interior Point Approach. John Wiley, Chichester, 1997.
H. D. Sherali, J. C. Smith, and Y. Lee. Enhanced model representations for an intraring synchronous optical network design problem allowing demand splitting. INFORMS Journal on Computing, 12(4):284–298, 2000.
L. N. Trefethen and D. Bau. Numerical Linear Algebra. SIAM, Philadelphia, PA, 1997.
R. J. Vanderbei. Linear Programming: Foundations and Extensions. Kluwer Academic Publishers, Boston, 1996. Second Edition: 2001.
S. Wright. Primal-dual interior point methods. SIAM, Philadelphia, 1996.
E. Yamakawa, Y. Matsubara, and M. Fukushima. A parallel primal-dual interior point method for multicommodity flow problems with quadratic costs. Journal of the Operations Research Society of Japan, 39(4):566–591, 1996.
Y. Ye. On the finite convergence of interior-point algorithms for linear programming. Mathematical Programming, 57(2):325–335, 1992.
Y. Ye. Interior Point Algorithms: Theory and Analysis. John Wiley, New York, 1997.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer Science+Business Media, Inc.
About this chapter
Cite this chapter
Mitchell, J.E., Farwell, K., Ramsden, D. (2006). Interior Point Methods for Large-Scale Linear Programming. In: Resende, M.G.C., Pardalos, P.M. (eds) Handbook of Optimization in Telecommunications. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-30165-5_1
Download citation
DOI: https://doi.org/10.1007/978-0-387-30165-5_1
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-30662-9
Online ISBN: 978-0-387-30165-5
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)