Mixed Integer Programming

From NEOS

Jump to: navigation, search

Mixed integer linear programming (MILP) problems have the general form

minimize	$c T x$
subject to	$A x = b$
	$x \geq 0$
	$x_i \in Z$ , for some $i \in \{1,\ldots,n\}$

where $Z$ is the set of integers.

Application of MILPs

Algorithms for MILPs

Retrieved from "http://wiki.mcs.anl.gov/NEOS/index.php/Mixed_Integer_Programming"

Views

Personal tools

Log in / create account

Search

Toolbox