Journal Article10.1080/1055678021000049381
LPAKO: A Simplex-based Linear Programming Program
Sungmook Lim,Soondal Park +1 more
6
TL;DR: Several aspects considered in the development of LPAKO such as the construction of initial basis, LU factorization of basis matrix, pricing rule, presolving/postsolving and other miscellaneous issues are described.
read more
Abstract: LPAKO is a public domain simplex-based linear programming program which can solve large-scale, sparse linear programming problems. It has been widely used in many applications and shows better performance than other public domain simplex-based programs. Several aspects considered in the development of LPAKO are described in this article such as the construction of initial basis, LU factorization of basis matrix, pricing rule, presolving/postsolving and other miscellaneous issues. At the end of the article, we introduce H. Mittelman's benchmark result which compares the performance of LPAKO with those of several simplex-based programs. We also compare LPAKO with CPLEX on the NETLIB test set.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Interior point techniques in optimization : complementarity, sensitivity and algorithms = Inwendige punt technieken in optimalisatie : complementariteit, gevoeligheid en algoritmen
Benjamin Jansen
- 01 Jan 1996
TL;DR: This book covers the implications of interior techniques for the entire field of mathematical programming, bringing together many results in a uniform and coherent way.
42
A new admissible pivot method for linear programming
Sungmook Lim,Soondal Park +1 more
TL;DR: A new admissible pivot method for linear programming that works with a sequence of improving primal feasible interior points and dual feasible interiorpoints and it is shown that this method outperforms Terlaky's criss-cross method by computational experiments.
1
The Design and Developement of Command-Based User Interface for High Speed Linear Programming Solving System
Sang-Gook Kim,Jae-Geun Ahn,Sungmook Lim,Soondal Park +3 more
- 01 Jan 2000
TL;DR: The design and the development of user interface for a high speed linear programming solving system and data input system that can understand user-written arithmetic form is added to the user interface system.
1
References
A new polynomial-time algorithm for linear programming
TL;DR: It is proved that given a polytopeP and a strictly interior point a εP, there is a projective transformation of the space that mapsP, a toP′, a′ having the following property: the ratio of the radius of the smallest sphere with center a′, containingP′ to theradius of the largest sphere withCenter a′ contained inP′ isO(n).
5K
•Book
Primal-Dual Interior-Point Methods
Stephen J. Wright
- 01 Jan 1987
TL;DR: This chapter discusses Primal Method Primal-Dual Methods, Path-Following Algorithm, and Infeasible-Interior-Point Algorithms, and their applications to Linear Programming and Interior-Point Methods.
2.6K
Direct methods for sparse matrices
TL;DR: This book aims to be suitable also for a student course, probably at MSc level, and the subject is intensely practical and this book is written with practicalities ever in mind.
2K
•Book
Theory and algorithms for linear optimization : an interior point approach
Cornelis Roos,Tamás Terlaky,J.-Ph. Vial +2 more
- 01 Jan 1997
TL;DR: This chapter discusses duality Theory for Linear Optimization, a Polynomial Algorithm for the Skew-Symmetric Model, and Parametric and Sensitivity Analysis, as well as implementing Interior Point Methods.
630
•Book
Direct methods for sparse matrices27100
I. S. Duff,A. M. Erisman,J. K. Reid +2 more
- 01 Jun 1986
563