11. Problems suitable for general solvers – LP and ILP
In the eleventh seminar, we have introduced linear programming (LP) and showed how to use an LP solver to obtain an optimal solution to an optimisation problem without programming. Moreover, we have stated that restricting the solution to integers makes the problem of finding a solution NP-hard. Finally, we obtained a 2-approximation of minimum vertex cover using a relaxation of its integer linear programming formulation.
Presentation
References
- MATOUŠEK, Jiří a Bernd GÄRTNER. Understanding and using linear programming. New York: Springer, 2007. ISBN 978-3-540-30697-9.
- SCHRIJVER, Alexander. Theory of linear and integer programming. Chichester: Wiley, 1998. ISBN 978-0-471-98232-6.