Introduction
In Integer programming problems, some or all of the variables are integers values.
Types of integer programming problems
- Pure integer programming problems in which all decision variables must be integer.
- Mixed integer programming problems in which some decision variables must be integer, but not all.
- 0-1 integer programming problems in which all decision variables must be either 0 or 1.
Integer programming problem methods
- Gomory's cutting plane method
- Branch and Bound method
- 0-1 integer programming problem method
This material is intended as a summary. Use your textbook for detail explanation.
Any bug, improvement, feedback then