Abstract
A class of methods is presented for solving standard linear programming problems. Like the simplex method, these methods move from one feasible solution to another at each iteration, improving the objective function as they go. Each such feasible solution is also associated with a basis. However, this feasible solution need not be an extreme point and the basic solution corresponding to the associated basis need not be feasible. Nevertheless, an optimal solution, if one exists, is found in a finite number of iterations (under nondegeneracy). An important example of a method in the class is the reduced gradient method with a slight modification regarding selection of the entering variable.
Similar content being viewed by others
References
G.B. Dantzig,Linear programming and extensions (Princeton University Press, Princeton, NJ, 1963).
P. Huard, “Convergence of the reduced gradient method”, presented in the Nonlinear Programming Symposium, Madison (1974).
C.E. Lemke, “The constrained gradient method of linear programming”,Journal of the Society of Industrial Applied Mathematics 9 (1961) 1–17.
P. Wolfe, “Methods of nonlinear programming”, in: J. Abadie, ed.,Nonlinear programming (Wiley, New York, 1967) Ch. 6.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Kallio, M., Porteus, E.L. A class of methods for linear programming. Mathematical Programming 14, 161–169 (1978). https://doi.org/10.1007/BF01588963
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01588963