BU275 Lecture Notes - Lecture 9: Integer Programming, Linear Programming Relaxation, Dialog Box
Document Summary
Rounding off non-integer solution values to integer values result in less-than optimal (suboptimal) results can result in an infeasible solution. Rounding non-integer solution values up to the nearest integer value. When all constraints are (cid:3409), rounding down non-integer solution. However, a rounded-down integer solution can result in a less-than- values ensures feasible solution optimal (suboptimal) solution. Solving ip models is harder than lp models: solution methods include: Lp relaxation model, complete enumeration, computer solution, Branch and bound method: based on the principle that the total set of feasible solutions can be partitioned into smaller subsets of solutions. Evaluate smaller subsets until best solution is found. Relax integer constraints and find regular lp solution. If lp solution is integer, it"s also the optimal solution for the ip. Round off (could also truncate, or round up or down) lp solutions may lead to poor solutions or infeasible solutions works best for large decision variable values.
