Skip to main content
Log in

Partitioning procedures for solving mixed-variables programming problems

  • Published:
Numerische Mathematik Aims and scope Submit manuscript

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

Access this article

Subscribe and save

Springer+ Basic
EUR 32.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or Ebook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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

Instant access to the full article PDF.


  1. Beale, E. M. L.: A Method of Solving Linear Programming Problems When Some But Not All of the Variables Must Take Integral Values. Statistical Techniques Research Group, Technical Report No.19, Princeton, N.J., July 1958.

  2. Benders, J. F.: Partitioning in Mathematical Programming. Thesis, Utrecht, July 4, 1960.

  3. Benders, J. F. A. R. Catchpole andC. Kuiken: Discrete Variables Optimization Problems. The Rand Symposium on Mathematical Programming, 16–20 March, 1959.

  4. Dantzig, G. B.: On the Significance of Solving Linear Programming Problems with Some Integer Variables. Econometrica28, 30–44 (1960).

    Google Scholar 

  5. —, andP. Wolfe: Decomposition Principle for Linear Programs. Operations Research8, 101–111 (1960).

    Google Scholar 

  6. Gass, S.: Linear Programming, Methods and Applications, New York: McGraw-Hill 1958.

    Google Scholar 

  7. Griffith, R. E., andR. A. Stewart: A Non-Linear Programming Technique for the Optimization of Continuous Processing Systems. Management. Science7, 379–392 (1961).

    Google Scholar 

  8. Goldman, A. J.: Resolution and Separation Theorems for Polyhedral Convex Sets. Linear Inequalities and Related Systems. Annals of Mathematics Studies38, 41–52, Princeton 1956.

    Google Scholar 

  9. Gomory, R. E.: An Algorithm for the Mixed Integer Problem. The Rand Corporation, P-1885, June 23, 1960.

  10. Kelly, J. E.: The Cutting Plane Method for Solving Convex Programs. J. Soc. Ind. and Appl. Math.8, 703–712 (1960).

    Google Scholar 

  11. Land, A. H., andA. G. Doig: An Automatic Method for Solving Discrete Programming Problems. Econometrica28, 497–520 (1960).

    Google Scholar 

  12. Rosen, J. B.: The Gradient Projection Method for Non-Linear Programming, Part I-Linear Constraints. J. Soc. Ind. and Appl. Math.8, 181–217 (1960).

    Google Scholar 

  13. Tucker, A. W.: Dual Systems of Homogeneous Linear Relations. Linear Inequalities and Related Systems. Annals of Mathematics Studies38, 3–18, Princeton 1956.

    Google Scholar 

  14. Zoutendijk, G.: Methods of Feasible Directions. A Study in Linear and Non-Linear Programming. Amsterdam: Elsevier Publ. Co. 1960.

    Google Scholar 

Download references

Author information

Authors and Affiliations


Additional information

Paper presented to the 8th International Meeting of the Institute of Management Sciences Brussels, August 23–26, 1961.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Benders, J.F. Partitioning procedures for solving mixed-variables programming problems. Numer. Math. 4, 238–252 (1962).

Download citation

  • Received:

  • Issue Date:

  • DOI: