R. K. Mueller
- 1 HADLEY, G. Linear Programming, ch.3-8, Addison-Wesley Publishing Co. Inc., Reading, Mass. 1963.Google Scholar
- 2 MILLS, R. An evaluation of the primal-dual algorithm for linear programming Masters Thesis, Massachusetts Institute of Technoloty, Cambridge, Mass, June 1960.Google Scholar
- 3 CLELLAND, R. C., AND TATE, M. W. Nonparametric and Shortcut Statistics in the Social, Biological, and Medical Sciences. Interstate Printers and Publishers, Inc., Danvile, Ill., 1957.Google Scholar
- 4 WOLFE, P., AND CUTLER, L. Experiments in linear programming. In Recent Advnces in Mathematical Programming, R. L. Graves, and P. Wolfe (Eds.), McGraw-Hill Book Co., New York, 1963.Google Scholar
- 5 KUHN, H., AND QUANDT, R. E., An experimental study of the simplex method. Proc. Symp. in Applied Mathmatics, Vol. XV, Amer, Math. Soe., Providence, R. L. 1963.Google ScholarCross Ref
Index Terms
- A comparison of the primal-simplex and primal-dual algorithms for linear programming
Recommendations
Primal-Dual Simplex Method for Multiobjective Linear Programming
We develop a primal-dual simplex algorithm for multicriteria linear programming. It is based on the scalarization theorem of Pareto optimal solutions of multicriteria linear programs and the single objective primal-dual simplex algorithm. We illustrate ...
Feasibility issues in a primal-dual interior-point method for linear programming
A new method for obtaining an initial feasible interior-point solution to a linear program is presented. This method avoids the use of a "big-M", and is shown to work well on a standard set of test problems. Conditions are developed for obtaining a near-...
A parallel primal-dual simplex algorithm
Recently, the primal-dual simplex method has been used to solve linear programs with a large number of columns. We present a parallel primal-dual simplex algorithm that is capable of solving linear programs with at least an order of magnitude more ...
Comments