Archives
BUSOP 743 Test
Consider the following discrete nonlinear programming problem. Maximize Z = , subject to x1 + x2 =< 0.75 and each variable is restricted to the values: . (a) Reformulate this problem as a pure binary integer linear programming problem. (b) […]
35 Pages |
July 21, 2015
MSE 118 Test 2
The Build-Em-Fast Company has agreed to supply its best customer with three widgits during each of the next 3 weeks, even though producing them will require some overtime work. The relevant production data are as follows: The cost per unit […]
7 Pages |
July 21, 2015
MSE 270
Consider the following problem. Minimize Z = 3×1 + 2×2, subject to and x1 >= 0, x2 >= 0. (a) Solve this problem graphically. (b) Using the Big M method, construct the complete first simplex tableau for the simplex method […]
24 Pages |
July 21, 2015