Date

1969

Document Type

Thesis

Degree

Master of Science

Department

Industrial Engineering

First Adviser

G. E. Whitehouse

Abstract

The multiple choice integer programming problem is one for which practical applications frequently arise. A computational procedure which optimally solves problems of this structure is developed by the author. The proposed procedure takes advantage of the particular characteristics of different types of problems within the multiple choice class. The method is primarily a branch and bound procedure which implicitly enumerates all of the possible combinations.

Share

COinS