Difference between revisions of "Integer Linear Programming"
| (13 intermediate revisions by 2 users not shown) | |||
| Line 5: | Line 5: | ||
:: maximize <math> \sum_{i=1}^m{c_i x_i} </math> | :: maximize <math> \sum_{i=1}^m{c_i x_i} </math> | ||
| − | where <math>c_i</math>'s are known and <math>x_i</math>'s are unknown, subject to linear equality or inequality constraints such as: | + | where <math>c_i\,\!</math>'s are known and <math>x_i\,\!</math>'s are unknown, subject to linear equality or inequality constraints such as: |
:: <math> \sum_{i=1}^m{a_i x_i} \le b_i</math> | :: <math> \sum_{i=1}^m{a_i x_i} \le b_i</math> | ||
| − | where <math>a_i</math>'s and <math>b_i</math>'s are known, and where <math>x_i</math>'s can only take integer values | + | where <math>a_i\,\!</math>'s and <math>b_i\,\!</math>'s are known, and where <math>x_i\,\!</math>'s can only take integer values |
| − | In other words, it is a method to find the optimal solution (i.e. the best assignment of unknown variables such as <math>x_i</math> | + | In other words, it is a method to find the optimal solution (i.e. the best assignment of unknown variables such as <math>x_i\,\!</math>) that maximizes the objective function while meeting a list of requirements expressed as linear equality or inequality relationships. |
| − | The strength of ILP is in its joint inference. Instead of making local, isolated assignment of each <math>x_i</math>, it makes joint assignments of all <math>x_i</math>'s at the same time; respecting the global constraints while optimizing the objective function given. | + | The strength of ILP is in its joint inference. Instead of making local, isolated assignment of each <math>x_i\,\!</math>, it makes joint assignments of all <math>x_i\,\!</math>'s at the same time; respecting the global constraints while optimizing the objective function given. |
ILP is known to be NP-hard. However, there are many off-the-shelf solvers, both commercial and non commercial, that are available. One such solver is [http://scip.zib.de/ SCIP], which is currently the fastest non commercial mixed integer programming solver. | ILP is known to be NP-hard. However, there are many off-the-shelf solvers, both commercial and non commercial, that are available. One such solver is [http://scip.zib.de/ SCIP], which is currently the fastest non commercial mixed integer programming solver. | ||
| Line 27: | Line 27: | ||
== Related Methods == | == Related Methods == | ||
| − | ILP is related to other methods | + | ILP method to do joint inference is related to other methods such as [[Markov_Logic_Networks|Markov Logic Networks]], a combination of first-order logic and Markov networks, which also incorporates global learning and inference to improve local classifiers' decisions. Global constraints are enforced through the addition of weighted first order logic formulae. The difference with ILP is that Markov Logic Network allows for non-deterministic (soft) constraints. Constraints are assigned different weights during learning phase, thus allowing for constraints that tend to hold but do not always have to. ILP on the other hand enforces hard constraints. It is possible to incorporate weighted constraints into ILPs, however it is not obvious how the weights should be learnt. |
| + | |||
| + | Another related method to do joint inference is a [http://www.cs.cmu.edu/~nlao/publication/2011/2011.emnlp.nell.pdf version] of Path Ranking Algorithm that conducts soft inference based on a combination of constrained, weighted, random walks through a network of local decisions and their relations. | ||
== References / Links == | == References / Links == | ||
| − | * Nemhauser, G.L. and Wolsey, L.A. Integer and combinatorial optimization, 18, Wiley New York | + | * Nemhauser, G.L. and Wolsey, L.A. ''Integer and combinatorial optimization'', Volume 18, Wiley New York, 1988. - [http://www.ulb.tu-darmstadt.de/tocs/103803378.pdf] |
* Wikipedia article on Integer Programming - [http://en.wikipedia.org/wiki/Integer_programming] | * Wikipedia article on Integer Programming - [http://en.wikipedia.org/wiki/Integer_programming] | ||
| Line 39: | Line 41: | ||
| ?UsesDataset | | ?UsesDataset | ||
}} | }} | ||
| + | |||
| + | == Comments == | ||
| + | |||
| + | I feel like ILP software packages are the point of formulating your problem as an ILP, since you're hoping that highly optimized ILP solvers will be better than whatever heuristic search algorithm you can cook up yourself. I mean, they're doing heuristic search too (it's all NP hard so it's all heuristics), but they might be doing it a lot better. My labmate [http://www.cs.cmu.edu/~dipanjan/ Dipanjan] found that when he moved a component of his semantic role labeler from a beam search to ILP, it went 100 times faster (!). This was with CPLEX, a commercial solver (that CMU has a license for); I get the impression it's pretty popular? | ||
| + | |||
| + | Speculation: It's worth considering that operations research people have been working on ILP for decades, and giant corporations and government organizations use these systems to plan logistics and operations, so every 1% performance improvement is millions of dollars, so if you're using CPLEX you get all those benefits. | ||
| + | |||
| + | Tangential related paper: Geoff Gordon, Sue Ann Hong, and Miro Dudik have a cool paper on adding first-order logic to mixed ILP's. http://www.cs.cmu.edu/~ggordon/gordon-hong-dudik-fop.pdf There's some sort of relationship to MLN's... like what you said, I think, but furthermore first-order ILP's can do quantifiers and predicates just like MLN's. | ||
| + | |||
| + | --[[User:Brendan|Brendan]] 23:06, 13 October 2011 (UTC) | ||
Latest revision as of 10:43, 14 October 2011
Summary
Integer Linear Programming (ILP) is a method for optimizing a linear objective function such as:
- maximize
where 's are known and 's are unknown, subject to linear equality or inequality constraints such as:
where 's and 's are known, and where 's can only take integer values
In other words, it is a method to find the optimal solution (i.e. the best assignment of unknown variables such as ) that maximizes the objective function while meeting a list of requirements expressed as linear equality or inequality relationships.
The strength of ILP is in its joint inference. Instead of making local, isolated assignment of each , it makes joint assignments of all 's at the same time; respecting the global constraints while optimizing the objective function given.
ILP is known to be NP-hard. However, there are many off-the-shelf solvers, both commercial and non commercial, that are available. One such solver is SCIP, which is currently the fastest non commercial mixed integer programming solver.
Procedure
Input:
- The linear objective function
- The linear constraints
Output:
- The assignment of unknown variables that optimizes the objective function and is consistent with the constraints
Related Methods
ILP method to do joint inference is related to other methods such as Markov Logic Networks, a combination of first-order logic and Markov networks, which also incorporates global learning and inference to improve local classifiers' decisions. Global constraints are enforced through the addition of weighted first order logic formulae. The difference with ILP is that Markov Logic Network allows for non-deterministic (soft) constraints. Constraints are assigned different weights during learning phase, thus allowing for constraints that tend to hold but do not always have to. ILP on the other hand enforces hard constraints. It is possible to incorporate weighted constraints into ILPs, however it is not obvious how the weights should be learnt.
Another related method to do joint inference is a version of Path Ranking Algorithm that conducts soft inference based on a combination of constrained, weighted, random walks through a network of local decisions and their relations.
References / Links
- Nemhauser, G.L. and Wolsey, L.A. Integer and combinatorial optimization, Volume 18, Wiley New York, 1988. - [1]
- Wikipedia article on Integer Programming - [2]
Relevant Papers
Comments
I feel like ILP software packages are the point of formulating your problem as an ILP, since you're hoping that highly optimized ILP solvers will be better than whatever heuristic search algorithm you can cook up yourself. I mean, they're doing heuristic search too (it's all NP hard so it's all heuristics), but they might be doing it a lot better. My labmate Dipanjan found that when he moved a component of his semantic role labeler from a beam search to ILP, it went 100 times faster (!). This was with CPLEX, a commercial solver (that CMU has a license for); I get the impression it's pretty popular?
Speculation: It's worth considering that operations research people have been working on ILP for decades, and giant corporations and government organizations use these systems to plan logistics and operations, so every 1% performance improvement is millions of dollars, so if you're using CPLEX you get all those benefits.
Tangential related paper: Geoff Gordon, Sue Ann Hong, and Miro Dudik have a cool paper on adding first-order logic to mixed ILP's. http://www.cs.cmu.edu/~ggordon/gordon-hong-dudik-fop.pdf There's some sort of relationship to MLN's... like what you said, I think, but furthermore first-order ILP's can do quantifiers and predicates just like MLN's.
--Brendan 23:06, 13 October 2011 (UTC)
