Accession Number : AD0715003

Title :   A Partitioning Algorithm for Separable Convex Mixed Integer Programming.

Descriptive Note : Technical rept.,

Corporate Author : FLORIDA UNIV GAINESVILLE DEPT OF INDUSTRIAL AND SYSTEMS ENGINEERING

Personal Author(s) : Riesco,Armando ; Thomas,M. E.

Report Date : AUG 1970

Pagination or Media Count : 139

Abstract : The report discusses a partitioning algorithm developed for solving separable convex mixed integer programming problems. The algorithm solves integer and continuous subproblems at each stage of the solution procedure and converges on the optimum in a finite number of stages. An experimental computer code was written for the algorithm and tested on an IBM 360/65. Computational results for the test problems used are provided to show the convergence of the algorithm on the optimal solution. The solution procedure presented is shown to be useful for solving a more general class of mixed integer programming problems than those presented herein. Possible extensions of the algorithm are indicated and areas for further research are suggested. (Author)

Descriptors :   (*LINEAR PROGRAMMING, ALGORITHMS), CONVEX SETS, DECISION THEORY, MATHEMATICAL MODELS, CONVERGENCE, PARTIAL DIFFERENTIAL EQUATIONS, INTEGRAL EQUATIONS, ITERATIONS, MATRICES(MATHEMATICS)

Subject Categories : Operations Research

Distribution Statement : APPROVED FOR PUBLIC RELEASE