Skip to main content
Log in

New Technique for Solving Primal All-integer Linear Programming

  • Short Note
  • Published:
OPSEARCH Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. GARFINKEL R.S. AND Nemhauser G.L. Integer Programming (John Wiley and Sons 1972).

    Google Scholar 

  2. GLOVER F. (1968), “A New Foundation for a simplified Primal Integer Programming Algorithm” Operations Research 16, 727–740.

    Article  Google Scholar 

  3. YOUNG R.D. (1965), “A primal (All-Integer) Integer Programming Algorithm”. J. Res. Nat Bur Stds, 69B. 2B–250.

    Google Scholar 

  4. YOUNG R.D. (1968). “A Simplified Primal (All-integer) Integer Programming Algorithm”, Operations Research 16, 750–782.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

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

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF03398508

Navigation