Abstract
This paper provides a new technique of selecting the pivot column and the source row in primal all-integer linear programming, by which the number of iterations has been reduced in going through the initial simplex table to the optimal simplex table.
Similar content being viewed by others
References
GARFINKEL R.S. AND Nemhauser G.L. Integer Programming (John Wiley and Sons 1972).
GLOVER F. (1968), “A New Foundation for a simplified Primal Integer Programming Algorithm” Operations Research 16, 727–740.
YOUNG R.D. (1965), “A primal (All-Integer) Integer Programming Algorithm”. J. Res. Nat Bur Stds, 69B. 2B–250.
YOUNG R.D. (1968). “A Simplified Primal (All-integer) Integer Programming Algorithm”, Operations Research 16, 750–782.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Sharma, S., Sharma, D.B. New Technique for Solving Primal All-integer Linear Programming. OPSEARCH 34, 62–68 (1997). https://doi.org/10.1007/BF03398508
Published:
Issue Date:
DOI: https://doi.org/10.1007/BF03398508