ADM 2302 Study Guide - Comprehensive Final Exam Guide - Shadow, Time, Sides Of An Equation

• School: University of Ottawa
• Department: Administration
• Course: ADM 2302
• Professor: Rim Jaber

Document Summary

Max time 100 sec, iterations 100, precision 0. 000001. Max subproblems unlimited, max integer sols unlimited, integer tolerance 5%, solve without integ. Source (grain elevator) a. chicago b. st. louis. 4x1 + 2x2 8 x1 4 x2 6 x1, x2 0. Special cases in linear programming: redundant constraints: A constraint that does not form a unique boundary of the feasible solution space; its removal would not alter the feasible solution space. The second constraint is redundant: no feasible solution. Occurs in problems where to satisfy one of the constraints, another constraint must be violated. Maximize z = 5x1 + 3x2 subject to: multiple optimal solutions. Problems in which different combinations of values of the decision variables yield the same optimal value. 4x1 + 3x2 120 x1, x2 0. The objective function can be parallel to a constrain line. Where: x1 = number of bowls x2 = number of mugs: unbounded solution. When nothing prevents the solution from becoming infinitely large.