Homework Answers
Add Answer to:
Problem 3. Consider the folowring set of constraints 1 + x2 +x37 2x1 52+10 1, 2, 20 Solve by usin...
Consider the following linear program: Maximize Z-3xI+2x2-X3 Subject to:X1+X2+2 X3s 10 2x1-X2+X3 s20 3 X1+X2s15 X1, X2,...
Consider the following linear program: Maximize Z-3xI+2x2-X3 Subject to:X1+X2+2 X3s 10 2x1-X2+X3 s20 3 X1+X2s15 X1, X2, X320 (a) Convert the above constraints to equalities. (2 marks) (b) Set up the initial simplex tableau and solve. (9 marks)
Consider the following linear program: Maximize Z-3xI+2x2-X3 Subject to:X1+X2+2 X3s 10 2x1-X2+X3 s20 3 X1+X2s15 X1, X2, X320 (a) Convert the above constraints to equalities. (2 marks) (b) Set up the initial simplex tableau and solve. (9 marks)
Operations Research Problem 2. Consider the following program: Minimize 2 22 subject to+ x2 s2 2x1...
Operations Research
Problem 2. Consider the following program: Minimize 2 22 subject to+ x2 s2 2x1 + 3x2 21 xi r2 21 Please solve the problem graphically and perform sensitivity analysis (along the lines of Supple- mentary text): (a) determine the amount of slack (or unused surplus) in the constraints at the optimal solu tion; )etie shadow prices/reduced s ociated with the constraints (c) for the binding constraints, determine the ranges for the right-hand side coefficients such that the constraints...
Duality Theory : Consider the following LP problem: Maximize Z = 2x1 + x2 - x3...
Duality Theory : Consider the following LP problem: Maximize Z = 2x1 + x2 - x3 subject to 2x1 + x2+ x3 ≤ 8 4x1 +x2 - x3 ≤ 10 x1 ≥ 0, x2 ≥ 0, x3 ≥ 0. (a) Find the dual for this LP (b) Graphically solve the dual of this LP. And interpret the economic meaning of the optimal solution of the dual. (c) Use complementary slackness property to solve the max problem (the primal problem). Clearly...
Problem #5 -- Consider the following linear programming problem: Maximize Z = 2x1 + 4x2 +...
Problem #5 -- Consider the following linear programming problem: Maximize Z = 2x1 + 4x2 + 3x3 subject to: X1 + 3x2 + 2x3 S 30 best to X1 + x2 + x3 S 24 3x1 + 5x2 + 3x3 5 60 and X120, X220, X3 2 0. You are given the information that x > 0, X2 = 0, and x3 >O in the optimal solution. Using the given information and the theory of the simplex method, analyze the...
Consider the following Linear Problem Minimize 2x1 + 2x2 equation (1) subject to: x1 + x2...
Consider the following Linear Problem Minimize 2x1 + 2x2 equation (1) subject to: x1 + x2 >= 6 equation (2) x1 - 2x2 >= -18 equation (3) x1>= 0 equation (4) x2 >= 0 equation (5) 13. What is the feasible region for Constraint number 1, Please consider the Non-negativity constraints. 14. What is the feasible region for Constraint number 2, Please consider the Non-negativity constraints. 15. Illustrate (draw) contraint 1 and 2 in a same graph and find interception...
6, Maximize z = 2x1 + x2 + 3x3 subject to x 3x2 5x3 s 10 2x x 20, x, 0, x320. (a) State the dua...
6, Maximize z = 2x1 + x2 + 3x3 subject to x 3x2 5x3 s 10 2x x 20, x, 0, x320. (a) State the dual problem. (b) Solve both the primal and the dual problem with any method that works. (c) Check that your optimal solutions are correct by verifying they are feasible and the primal and dual objective functions give the same value.
6, Maximize z = 2x1 + x2 + 3x3 subject to x 3x2 5x3 s...
Min 2x1 + x2 s.t. x1 + x2 ≥ 4 x1 – x2 ≥ 2 x1...
Min 2x1 + x2 s.t. x1 + x2 ≥ 4 x1 – x2 ≥ 2 x1 – 2x2 ≥ –1 x1 ≥ 0, x2 ≥ 0 Please solve the linear program graphically, showing the objective function, all constraints, the feasible region and marking all basic solutions (distinguishing the ones that are feasible).
Given: Objective function: maximize Z = 6x1+ 7x2 Constraints: x1 + 3 x2 30 4...
Given: Objective function: maximize Z = 6x1+ 7x2 Constraints: x1 + 3 x2 30 4 x1 + x2 32 x1 ≥ 0, x2 ≥ 0 a) Use graphical method to determine the optimal solution and the optimal value for Z.Use EXCEL to determine the optimal solution and the optimal value for Z.
2a. Consider the following problem. Maximize 17-Gri +80 Subject to 5x1 + 2x2 320 i 212 10 and Construct the dual problem for the above primal problem solve both the primal problem and the dual...
2a. Consider the following problem. Maximize 17-Gri +80 Subject to 5x1 + 2x2 320 i 212 10 and Construct the dual problem for the above primal problem solve both the primal problem and the dual problem graphically. Identify the corner- point feasible (CPF) solutions and comer-point infeasible solutions for both problems. Calculate the objective function values for all these values. Identify the optimal solution for Z. I 피 University 2b. For each of the following linear programming models write down...
3. Consider the following production problem Maximize 10r 12r2 20r, subject to the constraints xi...
3. Consider the following production problem Maximize 10r 12r2 20r, subject to the constraints xi +x2 +x3 10. ri + 2r2 +3rs 3 22, 2x1 2a2 +4x3 S 30 120, x2 20, 0 (a) (2 points) Solve the problem using the simplex method. Hint: Check your final tableau very carefully as the next parts will depend on its correct- ness. You will end up having 1, 2, r3 as basic variables. (b) (6 points) For1,2, and 3, determine the admissible...
Consider the following linear program: Maximize Z-3xI+2x2-X3 Subject to:X1+X2+2 X3s 10 2x1-X2+X3 s20 3 X1+X2s15 X1, X2, X320 (a) Convert the above constraints to equalities. (2 marks) (b) Set up the initial simplex tableau and solve. (9 marks)
Consider the following linear program: Maximize Z-3xI+2x2-X3 Subject to:X1+X2+2 X3s 10 2x1-X2+X3 s20 3 X1+X2s15 X1, X2, X320 (a) Convert the above constraints to equalities. (2 marks) (b) Set up the initial simplex tableau and solve. (9 marks)
Operations Research
Problem 2. Consider the following program: Minimize 2 22 subject to+ x2 s2 2x1 + 3x2 21 xi r2 21 Please solve the problem graphically and perform sensitivity analysis (along the lines of Supple- mentary text): (a) determine the amount of slack (or unused surplus) in the constraints at the optimal solu tion; )etie shadow prices/reduced s ociated with the constraints (c) for the binding constraints, determine the ranges for the right-hand side coefficients such that the constraints...
Problem #5 -- Consider the following linear programming problem: Maximize Z = 2x1 + 4x2 + 3x3 subject to: X1 + 3x2 + 2x3 S 30 best to X1 + x2 + x3 S 24 3x1 + 5x2 + 3x3 5 60 and X120, X220, X3 2 0. You are given the information that x > 0, X2 = 0, and x3 >O in the optimal solution. Using the given information and the theory of the simplex method, analyze the...
6, Maximize z = 2x1 + x2 + 3x3 subject to x 3x2 5x3 s 10 2x x 20, x, 0, x320. (a) State the dual problem. (b) Solve both the primal and the dual problem with any method that works. (c) Check that your optimal solutions are correct by verifying they are feasible and the primal and dual objective functions give the same value.
6, Maximize z = 2x1 + x2 + 3x3 subject to x 3x2 5x3 s...
2a. Consider the following problem. Maximize 17-Gri +80 Subject to 5x1 + 2x2 320 i 212 10 and Construct the dual problem for the above primal problem solve both the primal problem and the dual problem graphically. Identify the corner- point feasible (CPF) solutions and comer-point infeasible solutions for both problems. Calculate the objective function values for all these values. Identify the optimal solution for Z. I 피 University 2b. For each of the following linear programming models write down...
3. Consider the following production problem Maximize 10r 12r2 20r, subject to the constraints xi +x2 +x3 10. ri + 2r2 +3rs 3 22, 2x1 2a2 +4x3 S 30 120, x2 20, 0 (a) (2 points) Solve the problem using the simplex method. Hint: Check your final tableau very carefully as the next parts will depend on its correct- ness. You will end up having 1, 2, r3 as basic variables. (b) (6 points) For1,2, and 3, determine the admissible...
Most questions answered within 3 hours.
-
A couple have the following genotypes (for the ABO, Rh-factor
and Colour vision (XCB:normal vision,
Xcb:...
asked 3 minutes ago -
Variable Costing Income Statement for a Service Company The
actual and planned data for Underwater University...
asked 10 minutes ago -
Which of the following is NOT TRUE about collusion? It refers to
collective attempts to reduce...
asked 11 minutes ago -
Implement the following problem as a self-contained python
module.
Write a program that continually prompts the...
asked 15 minutes ago -
For each of the following complexes, give an energy level
diagram of the split d orbitals,...
asked 39 minutes ago -
Assume that the radioactive elements in the crust are uniformly
distributed (i.e. H=constant). The surface heat...
asked 41 minutes ago -
the
sole proprietorship that began business May 1 2018 incurred $9000
of start up expenses if...
asked 41 minutes ago -
Hult Games buys electronic components for manufacturing from two
suppliers, Milan Components and Dundee Parts. If...
asked 26 minutes ago -
Haygood Corp. purchased ten $1000 5% bonds of Energy Corporation
when the market rate of interest...
asked 36 minutes ago -
A person can see an object in proper focus only if the object is
no further...
asked 31 minutes ago -
A mixture of an equal number of moles of N2 and
H2 is contained in a...
asked 35 minutes ago -
Instructions: Each example shows a
sentence fragment. Provide an edited sentence that fixes the
fragment without...
asked 43 minutes ago