Integer linear programming
From IEETA
| Title | Integer Linear Programming |  |
|---|---|---|
| Speaker | Dorabella Santos | |
| Institution | Instituto de Telecomunicações | |
| Date | 2008/06/23 | |
| Time | 15:00 | |
| Location | Anfiteatro do IEETA | |
| Country | Portugal |
Abstract
Many engineering problems can be modeled as integer linear programming problems. It is known that linear programming is a polynomial time problem, whereas integer linear programming is a combinatorial problem. However, there are techniques for known problems which circumvent the combinatorial nature of these problems. This presentation briefly explains what a linear programming problem is and presents the various related dual problems. The integer linear problem is then discussed and some techniques are quickly described for solving known types of these problems.