Integer programming : dual fractional mixed integer programming (Gomory [2])

Authors

Harvey M. Salkin

Document Type

Report

Publication Date

4-1-1973

Abstract

This work represents the fourth chapter of a forthcoming textbook “Integer Programming” to be written by Harvey M. Salkin and published by Addison-Wesley. The cutting plane algorithm for the mixed integer program, developed by Ralph Gomory in 1960 and presented in this chapter, is a direct extension of the integer programming algorithm discussed in Chapter 3. Again, the intent is to whittle the feasible region down to one whose optimal vertex has integer values for the integer-constrained variables. As before, the cutting plane technique utilizes the dual simplex method and allows fractional numbers in computation and is thus classified as "dual fractional." For ease of reference, we rewrite the basic approach. The first tableau is not required to be all integer.

Keywords

Operations research, Integer programming, Linear programming, Algorithms

Publication Title

Integer Programming (1975) ; Technical Memorandums from the Department of Operations, School of Management, Case Western Reserve University

Issue

Technical memorandum no. 228a

Rights

This work is in the public domain and may be freely downloaded for personal or academic use

Recommended Citation

Salkin, Harvey M., "Integer programming : dual fractional mixed integer programming (Gomory [2])" (1973). Research Reports from the Department of Operations. 163.
https://commons.case.edu/wsom-ops-reports/163