Date of Award
1987
Degree Type
Master's Essay - Restricted
Degree Name
Master of Science (MS)
Department
Mathematical and Statistical Sciences
Abstract
Mathematical programming problems in which all variables can assume nonnegative integer values only are called pure integer programming problems. If in the absence of the integrality conditions the objective and constraint functions are linear, the resulting model is called an integer linear program. Such problems are hard to solve both in theory and in practice. One common approach is to solve the continuous version of the problem and then round the continuous optimum to the closest feasible integers. Here rounding implies approximation, so one cannot guarantee that the rounded solution will always satisfy the constraints, and the rounded solution cannot be feasible in linear programming problem since same basis can yield two different solutions
Recommended Citation
Rajput, Rohini R., "Integer Programming" (1987). Master's Essays (1922 - ). 2736.
https://epublications.marquette.edu/essays/2736
Comments
An Essay submitted to the faculty of the Graduate School, Marquette University, in partial fulfillment of the requirements for the Degree of Master of Science, Milwaukee, Wisconsin.