When solving Linear Programs, it is tempting to solve for the intercept of each constraint and then iterate all of the C

[answerhappygod]

When Solving Linear Programs It Is Tempting To Solve For The Intercept Of Each Constraint And Then Iterate All Of The C 1 (20.3 KiB) Viewed 19 times

When solving Linear Programs, it is tempting to solve for the intercept of each constraint and then iterate all of the Corner Point Feasible solutions and choose the best one. Why is that discouraged for practical applications? a. Because we may have infinite solutions along a boundary that iterating couldn't possibly uncover b. Because while for small, 2-dimensional problems with very few constraints it seems more efficient than the graphical method or the simplex method, for anything above 3- dimensions (aka 3 variables) the Simplex method is more efficient by 10 times c. All of these d. Because real-life problems are much larger, and the computational energy needed to iterate through each solution becomes unwieldy at size