Integer Optimization Program
An Integer Optimization Program is a mathematical optimization program where some or all of the Unknown Variables are Integer Variables.
- Context:
- It can be an input to a Integer Programming Task.
- It can range from being a Pure Integer Program to being a Mixed Integer Program.
- Example(s):
- an Integer Linear Program (for integer linear programming).
- …
- Counter-Example(s):
- See: Linear Program, Mixed Integer Program.
References
2014
- http://en.wikipedia.org/wiki/Integer_programming
- An integer programming problem is a mathematical optimization or feasibility program in which some or all of the variables are restricted to be integers. In many settings the term refers to integer linear programming (ILP), in which the objective function and the constraints (other than the integer constraints) are linear.
Integer programming is NP-hard. A special case, 0-1 integer linear programming, in which unknowns are binary, is one of Karp's 21 NP-complete problems.
- An integer programming problem is a mathematical optimization or feasibility program in which some or all of the variables are restricted to be integers. In many settings the term refers to integer linear programming (ILP), in which the objective function and the constraints (other than the integer constraints) are linear.