¶ … integer programming differ from those of linear programming.
(LP), is a type of convex programming, studies the case in which the objective function f is linear and the set of constraints is specified using only linear equalities and inequalities. Integer programming is the same thing, but with whole numbers. So integer programming is used with real life solutions that must be whole numbers that cannot be broken up.
Why is "rounding-down" an LP solution a suboptimal way to solve Integer programming problems?
It may create a solution that is very far away from the original solution. For example, consider:
max (2x + 3z)
where x and y are both integers above
the LP solution is
x= 4.5, y= 0.75
rounding down yields
x=4, y=0, with optimal objective value z=
but the optimal solution is actually x=4, y=1, with optimal objective value z=
So, if you were trying to find a value for something in the 10,000 units scale, the difference between 110,000 and 80,000 may be intolerably large.
3. Explain the characteristics of integer programming problems.
Give specific instances in which you would use an integer programming model rather than an LP model. Provide real-world examples.
You’re 61% through this paper. Sign up to read the full paper.
Sign Up Now — Instant Access Already a member? Log inAlways verify citation format against your institution’s current style guide requirements.