Mixed Integer Optimization Program

From GM-RKB
(Redirected from mixed integer program)
Jump to navigation Jump to search

A Mixed Integer Optimization Program is an integer optimization program that is a mixed mathematical optimization program.



References

2015

  • (Wikipedia, 2015) ⇒ http://en.wikipedia.org/wiki/integer_programming#Variants Retrieved:2015-6-20.
    • Mixed integer linear programming (MILP) involves problems in which only some of the variables, [math]\displaystyle{ x_i }[/math] , are constrained to be integers, while other variables are allowed to be non-integers.

      Zero-one linear programming involves problems in which the variables are restricted to be either 0 or 1. Note that any bounded integer variable can be expressed as a combination of binary variables. For example, given an integer variable, [math]\displaystyle{ 0\le x\le U }[/math], the variable can be expressed using [math]\displaystyle{ \lfloor \log_2U\rfloor+1 }[/math] binary variables: : [math]\displaystyle{ x = x_1+2x_2+4x_3+\ldots+2^{\lfloor \log_2U\rfloor}x_{\lfloor \log_2U\rfloor+1}. }[/math]

2013