David-Olivier Azulay
Abstract
We describe a modification of the simplex formulas in which Q-matrices are used to implement exact computations with an integer multiprecision library. Our motivation comes from the need for efficient and exact incremental solvers in the implementation of constraint solving languages such as Prolog. We explain how to reformulate the problem and the different steps of the simplex algorithm. We compare some measurements obtained with integer and rational computations.
- AZULAY, D.-O. 1999. Programmation lin~aire exacte avec Q-matrices. Ph.D. dissertation. Laboratoire d'Informatique de Marseille, Universit~ de la M~diterran~e.]]Google Scholar
- AZULAY, D.-O. 2001. Expecting a better numerical precision for some linear constraints. ACM Trans. Math. Softw., submitted.]]Google Scholar
- AZULAY, D.-O. AND PIQUE, J.-F. 1998. Optimized Q-pivot for exact linear solvers. In Principles and Practice of Constraint Programming (Pisa, Italy, Oct.), M. Maher and J.-F. Puget, Eds., Springer- Verlage New York, pp. 55-71.]] Google Scholar
- BAREISS, E. H. 1968. Sylvester's identity and multistep integer-preserving Gaussian elimination. Math. Comput. 22, 565-578.]]Google Scholar
- BAREISS, E. H. 1972. Computational solutions of matrix problems over an integral domain. J. Inst. Maths Applics 10, 68-104.]]Google Scholar
- BENHAMOU, F., BOUVIER, F., COLMERAUER, A., GARRETA, H., GILLETA, B., MASSAT,J.,AND NARBONI,G. 1996. Manual of Prolog IV. Prologia.]]Google Scholar
- BIXBY, R. E. 1992. Implementing the simplex method: The initial basis. ORSA J. Comput. 4,3, 267-284.]]Google Scholar
- BIXBY, R. E. 1994. Progress in linear programming. ORSA J. Comput. 6, 1, 15-22.]]Google Scholar
- CHV~TAL, V. 1983. Linear Programming W. H. Freeman and Company.]]Google Scholar
- EDMONDS, J. 1994. Exact pivoting. For ECCO VII.]]Google Scholar
- EDMONDS,J.AND MAURRAS, J.-F. 1997. Notes sur les Q-matrices d'Edmonds. RAIRO 31, 2, 203-209.]]Google Scholar
- GOLDFARB,D.AND REID, J. 1977. A practicable steepest-edge simplex algorithm. Math. Prog. 12, 361-371.]]Google Scholar
- GRANLUND, T. 1996. The GNU Multiple Precision Arithmetic Library (2.0.2 ed.). Free Software Foundation.]]Google Scholar
- IEEE. 1985. IEEE Standard for Binary Floating-Point Arithmetic, NASI/IEEE 754-1985. Institute of Electrical and Electronics Engineers.]]Google Scholar
- PIQUE, J.-F. 1995. Un algorithme efficace pour l'implantation de contraintes arithm~tiques en pr~cision infinie. In Real Numbers and Computers Conferences (Saint- ~tienne, France, Apr.). J.-C. Bajard, D. Michelucci, J.-M. Moreau, and J.-M. Muller, Eds. pp. 289-293.]]Google Scholar
Index Terms
- A revised simplex method with integer Q-matrices
Recommendations
Genetic algorithm based on simplex method for solving linear-quadratic bilevel programming problem
The bilevel programming problems are useful tools for solving the hierarchy decision problems. In this paper, a genetic algorithm based on the simplex method is constructed to solve the linear-quadratic bilevel programming problem (LQBP). By use of Kuhn-...
Klee-Minty's LP and upper bounds for Dantzig's simplex method
Kitahara and Mizuno (2010) [2] get two upper bounds for the number of different basic feasible solutions generated by Dantzig's simplex method. The size of the bounds highly depends on the ratio between the maximum and the minimum values of all the ...
Extending the QCR method to general mixed-integer programs
Let (MQP) be a general mixed integer quadratic program that consists of minimizing a quadratic function subject to linear constraints. In this paper, we present a convex reformulation of (MQP), i.e. we reformulate (MQP) into an equivalent program, with ...
Comments