Operations Research : Applications and Algorithms
4th Edition
ISBN: 9780534380588
Author: Wayne L. Winston
Publisher: Brooks Cole
expand_more
expand_more
format_list_bulleted
Expert Solution & Answer
Chapter 6.3, Problem 7P
a.
Explanation of Solution
New optimal solution
- Let
- For a maximization problem, the new optimal value = (old optimal value) + (Constraint i’s shadow price).
- For a minimization problem, the new optimal value = (old optimal value) – (Constraint i’s shadow price).
- Here
b.
Explanation of Solution
Optimal basis
- Let
- For a maximization problem, the new optimal value = (old optimal value) + (Constraint i’s shadow price).
- For a minimization problem, the new optimal value = (old optimal value) – (Constraint i’s shadow price)
c.
Explanation of Solution
New optimal solution
- Let
- For a maximization problem, the new optimal value = (old optimal value) + (Constraint i’s shadow price).
- For a minimization problem, the new optimal value = (old optimal value) – (Constraint i’s shadow price).
- Here
d.
Explanation of Solution
Optimal basis
- Let
- For a maximization problem, the new optimal value = (old optimal value) + (Constraint i’s shadow price).
- For a minimization problem, the new optimal value = (old optimal value) – (Constraint i’s shadow price)
e.
Explanation of Solution
New optimal solution
- Let
- For a maximization problem, the new optimal value = (old optimal value) + (Constraint i’s shadow price).
- For a minimization problem, the new optimal value = (old optimal value) – (Constraint i’s shadow price)
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
The following figure shows a linear programming problem where the shaded region represents the polytope of feasible solutions,
the colored lines represent constraint functions, and the black lines represent the contours of the objective function. Darker lines of
the objective function contour represent larger values. It also shows five different points, all of which lie within the polytope. The
linear program attempts to find the maximum value. Which point corresponds to a solution of the linear program?
2
(B) 5
1
3
E 4
20
…..
Which of the following provide a solution for the following LP problem?
MAX: 3X1 +4X2
Subject to:
X1 ≤ 12
X2 ≤ 10
4X1 _ 6X2 ≤ 72
X1, X2 ≥ 0
X1 = 12, X2 = 3
X1= 18, X2=0
PROFIT = 54
PROFIT= 56
Consider the following linear programming problem:
Min
A
+
2B
s.t.
A
+
4B
≤
21
2A
+
B
≥
7
3A
+
1.5B
≤
21
-2A
+
6B
≥
0
A, B
≥
0
Determine the amount of slack or surplus for each constraint. If required, round your answers to one decimal place.
(1)
A + 4B ≤ 21
Slack or surplus
(2)
2A + B ≥ 7
Slack or surplus
(3)
3A + 1.5B ≤ 21
Slack or surplus
(4)
-2A + 6B ≥ 0
Slack or surplus
Chapter 6 Solutions
Operations Research : Applications and Algorithms
Ch. 6.1 - Prob. 1PCh. 6.1 - Prob. 2PCh. 6.1 - Prob. 3PCh. 6.1 - Prob. 4PCh. 6.1 - Prob. 5PCh. 6.2 - Prob. 1PCh. 6.2 - Prob. 2PCh. 6.3 - Prob. 1PCh. 6.3 - Prob. 2PCh. 6.3 - Prob. 3P
Ch. 6.3 - Prob. 4PCh. 6.3 - Prob. 5PCh. 6.3 - Prob. 6PCh. 6.3 - Prob. 7PCh. 6.3 - Prob. 8PCh. 6.3 - Prob. 9PCh. 6.4 - Prob. 1PCh. 6.4 - Prob. 2PCh. 6.4 - Prob. 3PCh. 6.4 - Prob. 4PCh. 6.4 - Prob. 5PCh. 6.4 - Prob. 6PCh. 6.4 - Prob. 7PCh. 6.4 - Prob. 8PCh. 6.4 - Prob. 9PCh. 6.4 - Prob. 10PCh. 6.4 - Prob. 11PCh. 6.4 - Prob. 12PCh. 6.4 - Prob. 13PCh. 6.5 - Prob. 1PCh. 6.5 -
Find the duals of the following LPs:
Ch. 6.5 - Prob. 3PCh. 6.5 - Prob. 4PCh. 6.5 - Prob. 5PCh. 6.5 - Prob. 6PCh. 6.6 - Prob. 1PCh. 6.6 - Prob. 2PCh. 6.7 - Prob. 1PCh. 6.7 - Prob. 2PCh. 6.7 - Prob. 3PCh. 6.7 - Prob. 4PCh. 6.7 - Prob. 5PCh. 6.7 - Prob. 6PCh. 6.7 - Prob. 7PCh. 6.7 - Prob. 8PCh. 6.7 - Prob. 9PCh. 6.8 - Prob. 1PCh. 6.8 - Prob. 2PCh. 6.8 - Prob. 3PCh. 6.8 - Prob. 4PCh. 6.8 - Prob. 5PCh. 6.8 - Prob. 6PCh. 6.8 - Prob. 8PCh. 6.8 - Prob. 9PCh. 6.8 - Prob. 10PCh. 6.8 - Prob. 11PCh. 6.9 - Prob. 1PCh. 6.9 - Prob. 2PCh. 6.9 - Prob. 3PCh. 6.10 - Prob. 1PCh. 6.10 - Prob. 2PCh. 6.10 - Prob. 3PCh. 6.11 - Prob. 1PCh. 6.11 - Prob. 3PCh. 6.11 - Prob. 4PCh. 6.12 - Prob. 5PCh. 6.12 - Prob. 6PCh. 6.12 - Prob. 7PCh. 6 - Prob. 1RPCh. 6 - Prob. 2RPCh. 6 - Prob. 3RPCh. 6 - Prob. 4RPCh. 6 - Prob. 5RPCh. 6 - Prob. 6RPCh. 6 - Prob. 7RPCh. 6 - Prob. 8RPCh. 6 - Prob. 9RPCh. 6 - Prob. 10RPCh. 6 - Prob. 11RPCh. 6 - Prob. 13RPCh. 6 - Prob. 14RPCh. 6 - Prob. 15RPCh. 6 - Prob. 17RPCh. 6 - Prob. 18RPCh. 6 - Prob. 19RPCh. 6 - Prob. 20RPCh. 6 - Prob. 21RPCh. 6 - Prob. 22RPCh. 6 - Prob. 25RPCh. 6 - Prob. 29RPCh. 6 - Prob. 33RPCh. 6 - Prob. 34RPCh. 6 - Prob. 35RPCh. 6 - Prob. 36RPCh. 6 - Prob. 37RP
Knowledge Booster
Similar questions
- Problem 5. An Electricity board charges the following rates mentioned in the table for the use of electricity. All users are charged Taka 50 as a meter charge for every month. If any user wants to change/replace his meter, he will be charged taka 2000. The monthly bill will be generated based on ● Customer Category ● Consumed Units ● Phase ● For Category 3 and 5 along with other parameters, you need to also consider flat rate, peak time, and off-peak time. Take input from the user, how many units were consumed during flat rate, peak, or off-peak time. ● Meter Charge Write a program to read the name of the user, Customer Category, Phase, number of units consumed and print out the monthly bill. Note that ● Phase, flat rate, peak time and off-peak time will be appeared based on the customer category. ● The monthly bill will be calculated following the number of Days in a montharrow_forwardQ\Find the maximum and minimum values of. f (x, y.z) = xyz subject to the constraint 2 x + 9y² + z that x > 0 for this problem. = 4 Assume Why is this assumption needed?arrow_forwardProblem 1: The monthly payment M of a loan amount P for y years and with interest rate r can be calculated by the formula: P(r/12) M = 1-(1+r/12)-12y Calculate the monthly payment and the total payment for a $100,000 loan for 10, 11, 12, ..., 29, 30 years with an interest rate of 4.85%. Display the results in a three-column table where the first column is the number of years, the sec- ond is the monthly payment, and the third is the total payment.arrow_forward
- Using Python/PuLP solve At the beginning of month 1, Finco has $400 in cash. At the beginning of months 1, 2, 3, and 4, Finco receives certain revenues, after which it pays bills (see Table 2 below). Any money left over may be invested for one month at the interest rate of 0.1% per month; for two months at 0.5% per month; for three months at 1% per month; or for four months at 2% per month. Use linear programming to determine an investment strategy that maximizes cash on hand at the beginning of month 5. Formulate an LP to maximize Finco’s profit. Table 2 Month Revenues ($) Bills ($) 1 400 600 2 800 500 3 300 500 4 300 250arrow_forwardc) Knowing that we have the equality: 12Ar+3= B2hez determine the value of x and encircle it.arrow_forwardLinear Programming: Graphical Method Formulate the LP problem, which includes the objective function and the constraints. Then solve. Use Desmos calculator to graph. A furniture company produces inexpensive tables and chairs. The production process for each is similar in that both require a certain number of hours of carpentry work and a certain number of labor hours in the painting department. Each table takes 4 hours of carpentry and 2 hours in the painting department. Each chair requires 3 hours of carpentry and 1 hour in the painting department. During the current production period, 240 hours of carpentry time are available and 100 hours in painting is available. Each table sold yields a profit of P600; each chair produced is sold for a $250 profit. Find the best combination of tables and chairs to manufacture in order to reach the maximum profit.arrow_forward
- Solve the following equation in LINGO SOFTWARE ONLY. otherwise wait for many dislikes. PROBLEM 1. Objective Function is to maximize 8x1+7x2 Constraints: x1>10 x2<28 x1+x2<15arrow_forward. You borrow $500 and agree to repay $600 in two weeks, after two weeks the interest is 10% per week. if you begin weekly $100 payments after two weeks: List the amount due for the first 10 weeks Show the recurrence relation Develop a closed form solution Prove the closed form matches the recurrence relation for at least 10 iterationsarrow_forwardSolve the following exercise using jupyter notebook for Python, to find the objective function, variables, constraint matrix and print the graph with the optimal solution. A farm specializes in the production of a special cattle feed, which is a mixture of corn and soybeans. The nutritional composition of these ingredients and their costs are as follows: - Corn contains 0.09 g of protein and 0.02 g of fiber per gram, with a cost of.$0.30 per gram.- Soybeans contain 0.60 g of protein and 0.06 g of fiber per gram, at a cost of $0.90 per gram.0.90 per gram. The dietary needs of the specialty food require a minimum of 30% protein and a maximum of 5% fiber. The farm wishes to determine the optimum ratios of corn and soybeans to produce a feed with minimal costs while maintaining nutritional constraints and ensuring that a minimum of 800 grams of feed is used daily. Restrictions 1. The total amount of feed should be at least 800 grams per day.2. The feed should contain at least 30% protein…arrow_forward
- Please solve the following questionarrow_forwardPlease Solution All Point on Requiredarrow_forwardProblem 3: In a group of 36 people there are 20 Latvian citizens, 17 Burmese citizens, and 16 Tongan citizens. (And no citizens of other countries.) There are 7 people that have both Latvian and Burmese citizenship, 8 people that have both Latvian and Tongan citizenship, and 6 people tha thave both Burmese and Tongan citizenship. How many people in this group are citizens of all three countries?arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
Operations Research : Applications and AlgorithmsComputer ScienceISBN:9780534380588Author:Wayne L. WinstonPublisher:Brooks Cole
Operations Research : Applications and Algorithms
Computer Science
ISBN:9780534380588
Author:Wayne L. Winston
Publisher:Brooks Cole