OPERATIONS RES APP W/ STUDENT SOL MAN
4th Edition
ISBN: 9780534662257
Author: WINSTON
Publisher: CENGAGE L
expand_more
expand_more
format_list_bulleted
Expert Solution & Answer
Chapter 5, Problem 10RP
a.
Explanation of Solution
Optimum solution
- The new optimum solution value or profit is calculated by the given formula:
- The key row value can be calculated by the given formula:
b.
Explanation of Solution
Optimum solution
- The new optimum solution value or profit is calculated by the given formula:
- The key row value can be calculated by the given formula:
c.
Explanation of Solution
Meeting demand
- From the LINDO output, the shadow price for month 1 is 430.
- Thus if the demand of month 1 is increased by one, then the total cost decreases by -1.
- Hence the total cost is the shadow price of month 1 that is -430 since the total cost decreases by -1...
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
Can someone give an example/explanation of reading the optimal substructure from given code? I.e you're given a bit of code and then you have to determine what the optimal substructure is.
Suppose the risk index for the stock fund (the value of ) increases from its current value of 8 to 12. How does the optimal solution change, if at all?
Suppose the risk index for the money market fund (the value of ) increases from its current value of 3 to 3.5. How does the optimal solution change, if at all?
Suppose increases to 12 and increases to 3.5. How does the optimal solution change, if at all?
Demand of product A varies with the price as guided by the following equation.
Demand = -1.5 * price + 25
Moreover, sale of product A leads to sale of another product B of the same company. Additional data is as given below.
Unit cost of A (Rs.)
3
Number of units of B with one A
20
Profit from sale of one unit of B (Rs.)
0.85
Develop the optimization model for pricing of A to maximize total profit earned and find the optimal price.
Chapter 5 Solutions
OPERATIONS RES APP W/ STUDENT SOL MAN
Ch. 5.1 - Prob. 1PCh. 5.1 - Prob. 2PCh. 5.1 - Prob. 3PCh. 5.1 - Prob. 4PCh. 5.1 - Prob. 5PCh. 5.2 - Prob. 1PCh. 5.2 - Prob. 2PCh. 5.2 - Prob. 3PCh. 5.2 - Prob. 4PCh. 5.2 - Prob. 5P
Ch. 5.2 - Prob. 6PCh. 5.2 - Prob. 7PCh. 5.2 - Prob. 8PCh. 5.3 - Prob. 1PCh. 5.3 - Prob. 3PCh. 5.3 - Prob. 4PCh. 5.3 - Prob. 5PCh. 5.3 - Prob. 6PCh. 5.3 - Prob. 7PCh. 5.3 - Prob. 9PCh. 5.3 - Prob. 10PCh. 5.3 - Prob. 11PCh. 5 - Prob. 1RPCh. 5 - Prob. 2RPCh. 5 - Prob. 3RPCh. 5 - Prob. 4RPCh. 5 - Prob. 6RPCh. 5 - Prob. 7RPCh. 5 - Prob. 8RPCh. 5 - Prob. 9RPCh. 5 - Prob. 10RPCh. 5 - Prob. 11RPCh. 5 - Prob. 12RPCh. 5 - Prob. 13RPCh. 5 - Prob. 14RPCh. 5 - Prob. 15RPCh. 5 - Prob. 16RP
Knowledge Booster
Similar questions
- Which of the following statements are true given A* (admissibility and consistency of heuristics ] ? The heuristic function h[n] is called admissible if h[n] is never larger than h*[n], namely h[n] is always less or equal to true cheapest cost from n to the goal. If the heuristic function, h always underestimates the true cost [h[n] is smaller than h*[n]), then A* is guaranteed to find an optimal solution. When h is inconsistent, it can not be admissible. If h is consistent and h[goal)=0 then h is admissible A* is complete and optimalarrow_forwardA person is cutting a long board of wood into different length of pieces . Each cutting has fixed width 2 cm lengths. Given that each cutting with different length has a different price, Now, we are required to help this person to find the optimal cuts in order to increase his income. Consider following example showing different cut’s lengths and their equivalent prices. Input: board length = 4 Length [ ] = [1, 2, 3, 4, 5, 6, 7, 8] Price [ ] = [2, 6, 8, 10, 14, 17, 19, 20] Output: Best cut is two pieces of length 2 each to gain revenue of 6 + 6 = 12 [Explanation: the possible cuts and profit of each is as follows: As noted the best cut is two pieces of length 2 each to gain revenue of 6 + 6 = 12arrow_forward1-)a.Find the starting solution of this transportation model by Least Cost Method. (Unit transportation costs are given in the table) 2-)Then find the optimal solution of this transportation model by Stepping Stone Method. D1 D2 D3 D4 Supply M1 16 24 14 11 25 M2 21 18 17 9 30 M3 15 13 21 14 40 Demand 25 25 20 25arrow_forward
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