Half 4: Extending linear programming optimization to discrete resolution variables
Up till now on this sequence, we’ve talked about strict linear programming — the place the target perform, constraints and resolution variables have all been linear and steady. This linear arrange comes with some very nice properties, however it isn’t very versatile. On this article, I’ll focus on how we are able to enable for discrete resolution variables utilizing a instrument referred to as integer linear programming (ILP).
That is the fourth article in a sequence I’m writing on linear programming. The opposite articles (together with an introduction — in case you aren’t acquainted with linear programming) will be discovered right here:
Linear Programming
On this article we’ll be protecting the next matters:
- When discrete resolution variables are wanted
- How the department and certain algorithm solves integer linear programming issues
- The professionals and cons of integer linear programming…