Presentatiom
BUS 306 Fall 2012 H. Saber
Names:
Assignment #2 (Due October 7, 2012)
A. 1. Review chapter3 from the textbook and do all the cases in the chapter independently. 2. Go through all the Solved Problems on chapters 2 and 3 in the textbook CD independently.
B. C.
1. Provide complete solutions to problems 3.21, 3.25, 3.30, 3.34 from the textbook on pages 104 – 107 Submit the solution to the following questions. 1. Consider the following LP: Maximize Z = 3X1 + 2X2 Subject to: 2X1 + 4 X2 -X1 + 4 X2 4X1 - 2 X2 1X1 - 1 X2 ≤ 22 ≤ 10 ≤ 14 ≤3 (1) (2) (3) (4)
(a) Graph the above LP model by (i) including and labeling all the constraints, (ii) highlighting the feasible region, (iii) drawing the objective function line and the gradient direction. (5 points) (b) Find the optimal solution and the optimal value of the objective function for the above model. Is the optimal solution unique, alternative, or unbounded? (2 points) (c) How would your answer in (b) change if the direction constraints 1, 2, and 3 were revered from (≤) to (≥) type? Will there be any redundant constraints? If yes which one? (3 points)
2. To stimulate interest and provide an atmosphere for intellectual discussion, a business faculty decides to hold special seminars on four contemporary topics—Globalization, E-Commerce, Transportation, and Change Management. Such seminars should be held in the afternoons. However, scheduling these seminars (one for each topic, and not more than one seminar per afternoon) has to be done carefully so that the number of students unable to attend is kept to a minimum. A study indicates that the number of students who cannot attend a particular seminar on a day is as follows:
Globalization Sunday Monday Tuesday Wednesday Thursday 50 40 60 30 10 E-Commerce 40 30 20 30 20 Transportation 60 40 30 20 10 Change Management 20 30 20 30 30
Set up the algebraic LP assignment model for the above formulation that includes (a) definitions of all the decision variables in the
Names:
Assignment #2 (Due October 7, 2012)
A. 1. Review chapter3 from the textbook and do all the cases in the chapter independently. 2. Go through all the Solved Problems on chapters 2 and 3 in the textbook CD independently.
B. C.
1. Provide complete solutions to problems 3.21, 3.25, 3.30, 3.34 from the textbook on pages 104 – 107 Submit the solution to the following questions. 1. Consider the following LP: Maximize Z = 3X1 + 2X2 Subject to: 2X1 + 4 X2 -X1 + 4 X2 4X1 - 2 X2 1X1 - 1 X2 ≤ 22 ≤ 10 ≤ 14 ≤3 (1) (2) (3) (4)
(a) Graph the above LP model by (i) including and labeling all the constraints, (ii) highlighting the feasible region, (iii) drawing the objective function line and the gradient direction. (5 points) (b) Find the optimal solution and the optimal value of the objective function for the above model. Is the optimal solution unique, alternative, or unbounded? (2 points) (c) How would your answer in (b) change if the direction constraints 1, 2, and 3 were revered from (≤) to (≥) type? Will there be any redundant constraints? If yes which one? (3 points)
2. To stimulate interest and provide an atmosphere for intellectual discussion, a business faculty decides to hold special seminars on four contemporary topics—Globalization, E-Commerce, Transportation, and Change Management. Such seminars should be held in the afternoons. However, scheduling these seminars (one for each topic, and not more than one seminar per afternoon) has to be done carefully so that the number of students unable to attend is kept to a minimum. A study indicates that the number of students who cannot attend a particular seminar on a day is as follows:
Globalization Sunday Monday Tuesday Wednesday Thursday 50 40 60 30 10 E-Commerce 40 30 20 30 20 Transportation 60 40 30 20 10 Change Management 20 30 20 30 30
Set up the algebraic LP assignment model for the above formulation that includes (a) definitions of all the decision variables in the