Problem 1. Model the following problem as an LP and solve it by the graphical method...
Problem 3: Consider the following LP. (a) Solve the LP with the graphical method. (b) Place the model in standard form. (c) Use a simplex algorithm in tableau form and solve the LP. (d) Using matrix A and b recalculate the basic feasible solution and the directions for the first iteration.
3. (Waner 4.5 #9) Solve the following LP problem by either the graphical or cornerpoint method (make sure that you indicate and check all of the possible cornerpoints): Minimize c=s+t subject to: s+ 2t >= 6 2s + t >=6 st >= 0
5. Solve the following LP problem using Phase I and Phase II simplex algorithm. Maximize f(X) = x1 + x2, subject to: 4x1-2x2 8 XI6 X1, X20 5. Solve the following LP problem using Phase I and Phase II simplex algorithm. Maximize f(X) = x1 + x2, subject to: 4x1-2x2 8 XI6 X1, X20
*5. Solve the following LP problem using two-phase Simplex method: Maximize f= 4x1+ x2 + x3 subject to: 2x1x22x3= 4 Зх1 +3x2 + хз %3D 3, X12 0, х2 20, х3 2 0. [Note: Since a BFS is not available, start Phase I simplex algorithm by introducing variables] two artificial *5. Solve the following LP problem using two-phase Simplex method: Maximize f= 4x1+ x2 + x3 subject to: 2x1x22x3= 4 Зх1 +3x2 + хз %3D 3, X12 0, х2 20,...
only 2 PROBLEM SET 3.5A *1. Consider the graphical solution space in Figure 3.8. Suppose that the simplex iterations start at A and that the optimum solution occurs at D. Further, assume that the objective function is defined such that at A, x, enters the solution first. (a) Identify (on the graph) the corner points that define the simplex method path to the optimum point. (b) Determine the maximum possible number of simplex iterations needed to reach the optimum solution,...
Solve the following LP problem using the Simplex Method. Type out all work. (Use the table function 3. with borders to create your tableaux.) Maximize subject to x + 3y +zS15 3x 2y +zs 25 x20,y2 0, z20
*5. Solve the following LP problem using two-phase Simplex method: Maximize f- 4x1x2 X3 subject to 2х1 + X2 + 2хз - 4, Зх1 + 3x2 + хз 3 3, х120, х2 2 0, хз 2 0. Note: Since a BFS is not available, start Phase I simplex algorithm by introducing two artificial variables] *5. Solve the following LP problem using two-phase Simplex method: Maximize f- 4x1x2 X3 subject to 2х1 + X2 + 2хз - 4, Зх1 + 3x2...
(a) (1 pointd What type of problem, hence model ls this? (b) [14 pointa] Formulate the LP for the problem 3. The management of a hospital is trying to find an optimal schedule for its 60 nurses. There are three shifts everyday: Night (24:00-8:00), Day (8:00-16:00) and Swing (16:00-24:00). Minimum number of nurses who must be on duty each shift is given below: [16 points) Shift Mon Tue Wed Thu Fri Sat Sun Night 5324 3 22 Day795 725 Swing...
Problem 4: Sensitivity Analysis (Total 25 points) Consider the following linear program. Solve using the graphical method. A company manufactures two products, A and B. The unit revenues are $5 and $8, respectively. Two raw materials, M1 and M2 are used. The supply of M1 and M2 are 4 and 12 units, respectively. Maximize z= 5x1 + 8x2 Subject to M1 2x1 + x2 <4 3x1 + 6x2 < 12 X1, x2 > 0 M2 a) Changes in Constraint RHS...
SIMPLEX METHOD Solve the following problem using simplex method LP MODEL Let X1 no. of batches of Bluebottles X2 no. of batches of Cleansweeps Objective: Max Z-10X1+20X2 Subject to: 3X1 4X2 S 3 Plant 1 assembly capacity constraint -X1 2-5 5X1 +6X2 s 18 Z, X1, X2 20 Plant 2 capacity constraint Plant 3 capacity constraint