Numerische Mathematik

, Volume 4, Issue 1, pp 238–252 | Cite as

Partitioning procedures for solving mixed-variables programming problems

  • J. F. Benders


Mathematical Method Programming Problem Partitioning Procedure 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [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.Google Scholar
  2. [2]
    Benders, J. F.: Partitioning in Mathematical Programming. Thesis, Utrecht, July 4, 1960.Google Scholar
  3. [3]
    Benders, J. F. A. R. Catchpole andC. Kuiken: Discrete Variables Optimization Problems. The Rand Symposium on Mathematical Programming, 16–20 March, 1959.Google Scholar
  4. [4]
    Dantzig, G. B.: On the Significance of Solving Linear Programming Problems with Some Integer Variables. Econometrica28, 30–44 (1960).Google Scholar
  5. [5]
    —, andP. Wolfe: Decomposition Principle for Linear Programs. Operations Research8, 101–111 (1960).Google Scholar
  6. [6]
    Gass, S.: Linear Programming, Methods and Applications, New York: McGraw-Hill 1958.Google Scholar
  7. [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. [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. [9]
    Gomory, R. E.: An Algorithm for the Mixed Integer Problem. The Rand Corporation, P-1885, June 23, 1960.Google Scholar
  10. [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. [11]
    Land, A. H., andA. G. Doig: An Automatic Method for Solving Discrete Programming Problems. Econometrica28, 497–520 (1960).Google Scholar
  12. [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. [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. [14]
    Zoutendijk, G.: Methods of Feasible Directions. A Study in Linear and Non-Linear Programming. Amsterdam: Elsevier Publ. Co. 1960.Google Scholar

Copyright information

© Springer-Verlag 1962

Authors and Affiliations

  • J. F. Benders
    • 1
  1. 1.Koninklijke/Shell-LaboratoriumAmsterdam

Personalised recommendations