4. Reconsider the model in Problem 3 with objective function Maximize Z = C₁x₁ + ₂x₂, where C₁ ≥ 0, C₂ ≥ 0. Use the sensitivity analysis on the objective coefficients to answer the following questions. (a) Find the range of such that the optimal solution remains as (x₁, x₂) = (3,4). C₁ (b) Find the range of such that the optimal solution remains as (x₁,x₂) = (4,2). C₂ (c) Find the range of such that the optimal solution remains as (x₁, x₂) = (0,5). (d) If c₁ and c₂ are allowed to be negative, find the conditions on c₁ and C₂, and the range of such that the optimal solution remains as (x₁, x₂) = (4,0). C₂ Question 3 is given as follows: 3. Consider the following problem. Maximize Z = 3x₁ + 2x₂, subject to X1 ≤4 x₁ + 3x₂ ≤ 15 2x₁ + x₂ ≤ 10 (resource 1) (resource 2) (resource 3) and x₁ ≥ 0, x₂ ≥ 0, x3 ≥ 0. The optimal solution is (x₁, x₂) = (3,4) with Z* = 17. (a) Is any of these three constraints binding constraint? (b) Use graphical analysis to determine the shadow prices for the respective resources. 3

Practical Management Science
6th Edition
ISBN:9781337406659
Author:WINSTON, Wayne L.
Publisher:WINSTON, Wayne L.
Chapter2: Introduction To Spreadsheet Modeling
Section: Chapter Questions
Problem 20P: Julie James is opening a lemonade stand. She believes the fixed cost per week of running the stand...
icon
Related questions
Question
4. Reconsider the model in Problem 3 with objective function Maximize Z = C₁x₁ + ₂x₂, where
C₁ ≥ 0, C₂ ≥ 0. Use the sensitivity analysis on the objective coefficients to answer the following
questions.
(a) Find the range of 1, such that the optimal solution remains as (x₁,x₂) = (3,4).
C₂
(b) Find the range of
such that the optimal solution remains as (x₁, x₂) = (4, 2).
(c) Find the range of
such that the optimal solution remains as (x₁, x₂) = (0,5).
(d) If c₁ and c₂ are allowed to be negative, find the conditions on c₁ and C₂, and the range of
such that the optimal solution remains as (x₁, x₂) = (4,0).
C₂
Question 3 is given as follows:
3. Consider the following problem.
Maximize Z = 3x₁ + 2x₂,
subject to
X1
(resource 1)
<4
x₁ + 3x₂15
(resource 2)
2x₁ + x₂ 10 (resource 3)
and x₁ ≥ 0, x₂ ≥ 0, x3 ≥ 0.
The optimal solution is (x₁, x₂) = (3,4) with Z* = 17.
(a) Is any of these three constraints binding constraint?
(b) Use graphical analysis to determine the shadow prices
for the respective resources.
3
14
Transcribed Image Text:4. Reconsider the model in Problem 3 with objective function Maximize Z = C₁x₁ + ₂x₂, where C₁ ≥ 0, C₂ ≥ 0. Use the sensitivity analysis on the objective coefficients to answer the following questions. (a) Find the range of 1, such that the optimal solution remains as (x₁,x₂) = (3,4). C₂ (b) Find the range of such that the optimal solution remains as (x₁, x₂) = (4, 2). (c) Find the range of such that the optimal solution remains as (x₁, x₂) = (0,5). (d) If c₁ and c₂ are allowed to be negative, find the conditions on c₁ and C₂, and the range of such that the optimal solution remains as (x₁, x₂) = (4,0). C₂ Question 3 is given as follows: 3. Consider the following problem. Maximize Z = 3x₁ + 2x₂, subject to X1 (resource 1) <4 x₁ + 3x₂15 (resource 2) 2x₁ + x₂ 10 (resource 3) and x₁ ≥ 0, x₂ ≥ 0, x3 ≥ 0. The optimal solution is (x₁, x₂) = (3,4) with Z* = 17. (a) Is any of these three constraints binding constraint? (b) Use graphical analysis to determine the shadow prices for the respective resources. 3 14
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 3 steps with 3 images

Blurred answer
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
Practical Management Science
Practical Management Science
Operations Management
ISBN:
9781337406659
Author:
WINSTON, Wayne L.
Publisher:
Cengage,
Operations Management
Operations Management
Operations Management
ISBN:
9781259667473
Author:
William J Stevenson
Publisher:
McGraw-Hill Education
Operations and Supply Chain Management (Mcgraw-hi…
Operations and Supply Chain Management (Mcgraw-hi…
Operations Management
ISBN:
9781259666100
Author:
F. Robert Jacobs, Richard B Chase
Publisher:
McGraw-Hill Education
Business in Action
Business in Action
Operations Management
ISBN:
9780135198100
Author:
BOVEE
Publisher:
PEARSON CO
Purchasing and Supply Chain Management
Purchasing and Supply Chain Management
Operations Management
ISBN:
9781285869681
Author:
Robert M. Monczka, Robert B. Handfield, Larry C. Giunipero, James L. Patterson
Publisher:
Cengage Learning
Production and Operations Analysis, Seventh Editi…
Production and Operations Analysis, Seventh Editi…
Operations Management
ISBN:
9781478623069
Author:
Steven Nahmias, Tava Lennon Olsen
Publisher:
Waveland Press, Inc.