G. J. Tee
- L. G. Khachian, 'A polynomial algorithm in linear programming' (in Russian), Doklady Akad. Nauk SSSR 1979, t. 244, No. 5, 1093--1096.Google Scholar
- Richard M. Karp, 'Reducibility among combinatorial problems', pre-print dated April 1972. Russian translation cited by Khachian {1} as Kibernetich. sbornik, Nov. ser. v. 12, 16 (1975).Google Scholar
- Gina Bari Kolata, 'Mathematicians amazed by Russian's discovery', SCIENCE, 2-11-79, 545--546.Google Scholar
- Harold Jackson, 'Russian way with the Travelling Salesman', The Guardian, 29-10-79.Google Scholar
- L. G. Khachian, 'Convergence rate of the game processes for solving matrix games' (in Russian), Zh. vych. mat. i mat. fiz. 1979, 17, No. 16, 1421--1431.Google Scholar
- L. G. Khachian&A. I. Erlikh, 'On the convergence of iterative game processes with non-unique choice of steps by the partner' (in Russian), Ekon. i mat. metody 1978, 14, No. 2, 332--344.Google Scholar
- L. G. Khachian&A. I. Erlikh, 'Serial game processes for the problem of convex programming' (in Russian), Izv. Akad. Nauk SSSR, Tekh. kib. 1978, No. 2, 193--196.Google Scholar
- L. G. Khachian, 'On the convergence of iterative processes for seeking points of equilibrium' (in Russian), Mekh. tverd. deform. tela i rodstven. probl. analiza, Moscow, 1978, 90--95.Google Scholar
- L. G. Khachiyan, 'Convergence rate of the game processes for solving matrix games', USSR Comp. Math. and Math. Phys., v. 17, No. 6, 78--88 (published December 1978).Google Scholar
Index Terms
- Khachian's efficient algorithm for linear inequalities and linear programming
Recommendations
New Branch-and-Cut Algorithm for Bilevel Linear Programming
Linear mixed 0---1 integer programming problems may be reformulated as equivalent continuous bilevel linear programming (BLP) problems. We exploit these equivalences to transpose the concept of mixed 0---1 Gomory cuts to BLP. The first phase of our new ...
A simplex algorithm for piecewise-linear programming I: Derivation and proof
The simplex method for linear programming can be extended to permit the minimization of any convex separable piecewise-linear objective, subject to linear constraints. This three-part paper develops and analyzes a general, computationally practical ...
Solving Bilevel Linear Programs Using Multiple Objective Linear Programming
We present an algorithm for solving bilevel linear programs that uses simplex pivots on an expanded tableau. The algorithm uses the relationship between multiple objective linear programs and bilevel linear programs along with results for minimizing a ...
Comments