Optimal Objective Value = 860.00000 Variable Value Reduced Cost W 560.00000 0.00000 M 240.00000 0.00000 Constraint Slack/Surplus Dual Value 1 0.00000 0.12500 2 160.00000 0.00000 0.00000 0.18750 Objective Allowable Allowable Variable Coefficient Increase Decrease W 1.00000 0.25000 0.10714 M 1.25000 0.15000 0.25000 RHS Allowable Allowable Constraint Value Increase Decrease 4480.00000 1120.00000 160.00000 2080.00000 Infinite 160.00000 3 1600.00000 40.00000 320.00000 The computer solution is shown in Figure 3.15. a. What is the optimal solution, and what are the optimal production quantities? b. Specify the objective function ranges. c. What are the dual values for each constraint? Interpret each. d. Identify each of the right-hand-side ranges.

Operations Research : Applications and Algorithms
4th Edition
ISBN:9780534380588
Author:Wayne L. Winston
Publisher:Wayne L. Winston
Chapter11: Nonlinear Programming
Section11.1: Review Of Differential Calculus
Problem 7P
icon
Related questions
Question
100%
9. Recall the TJ Inc.'s problem (Chapter 2, Problem 28). Letting
W = jars of Western Foods Salsa
M = jars of Mexico City Salsa
leads to the formulation:
Max 1W + 1.25M
s.t.
5W + 7M < 4480
Whole tomatoes
3W + 1M < 2080
Tomato sauce
2W + 2M < 1600
Tomato paste
W, M > 0
Transcribed Image Text:9. Recall the TJ Inc.'s problem (Chapter 2, Problem 28). Letting W = jars of Western Foods Salsa M = jars of Mexico City Salsa leads to the formulation: Max 1W + 1.25M s.t. 5W + 7M < 4480 Whole tomatoes 3W + 1M < 2080 Tomato sauce 2W + 2M < 1600 Tomato paste W, M > 0
FIGURE 3.15 THE SOLUTION FOR THE TJ INC'S PROBLEM
Optimal Objective Value
860.00000
%3D
Variable
Value
Reduced Cost
W
560.00000
0.00000
M
240.00000
0.00000
Constraint
Slack/Surplus
Dual Value
1
0.00000
0.12500
160.00000
0.00000
0.00000
0.18750
Objective
Allowable
Allowable
Variable
Coefficient
Increase
Decrease
W
1.00000
0.25000
0.10714
M
1.25000
0.15000
0.25000
RHS
Allowable
Allowable
Constraint
Value
Increase
Decrease
1
4480.00000
1120.00000
160.00000
2080.00000
Infinite
160.00000
1600.00000
40.00000
320.00000
The computer solution is shown in Figure 3.15.
a. What is the optimal solution, and what are the optimal production quantities?
b. Specify the objective function ranges.
c. What are the dual values for each constraint? Interpret each.
d. Identify each of the right-hand-side ranges.
Transcribed Image Text:FIGURE 3.15 THE SOLUTION FOR THE TJ INC'S PROBLEM Optimal Objective Value 860.00000 %3D Variable Value Reduced Cost W 560.00000 0.00000 M 240.00000 0.00000 Constraint Slack/Surplus Dual Value 1 0.00000 0.12500 160.00000 0.00000 0.00000 0.18750 Objective Allowable Allowable Variable Coefficient Increase Decrease W 1.00000 0.25000 0.10714 M 1.25000 0.15000 0.25000 RHS Allowable Allowable Constraint Value Increase Decrease 1 4480.00000 1120.00000 160.00000 2080.00000 Infinite 160.00000 1600.00000 40.00000 320.00000 The computer solution is shown in Figure 3.15. a. What is the optimal solution, and what are the optimal production quantities? b. Specify the objective function ranges. c. What are the dual values for each constraint? Interpret each. d. Identify each of the right-hand-side ranges.
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 7 steps with 7 images

Blurred answer
Knowledge Booster
Decision Making Process
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
Operations Research : Applications and Algorithms
Operations Research : Applications and Algorithms
Computer Science
ISBN:
9780534380588
Author:
Wayne L. Winston
Publisher:
Brooks Cole