Operations Research : Applications and Algorithms
4th Edition
ISBN: 9780534380588
Author: Wayne L. Winston
Publisher: Brooks Cole
expand_more
expand_more
format_list_bulleted
Concept explainers
Expert Solution & Answer
Chapter 6.1, Problem 1P
Explanation of Solution
New Optimal solution
- In linear
programming , the shadow price of a constraint is the difference between the optimised value of the objective function and the value of the objective function evaluated when the right hand side of a constraint is increased by one unit. - When the slack or excess variable for a constraint is positive in a linear problem’s optimal solution, then the constraint will have a zero shadow price.
- For a maximization 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 solutionStudents have asked these similar questions
QUESTION 9
What is one advantage of AABB over Bounding Spheres?
Computing the optimal AABB for a set of points is easy to program and
can be run in linear time. Computing the optimal bounding sphere is a
much more difficult problem.
The volume of AABB can be an integer, while the volume of a Bounding
Sphere is always irrational.
An AABB can surround a Bounding Sphere, while a Bounding Sphere
cannot surround an AABB.
To draw a Bounding Ball you need calculus knowledge.
Suppose that there are four items available which can be put into a knapsack that has a capacity of 13 pounds. The weights of the items are 5,7,4, and 3 pounds respectively. Their utilities are 8,11,6 and 4 respectively. Find the optimal solution that maximizes the total utility of the knapsack.
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?
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
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
- A pig weighting 200 pounds gains 5 pounds per day and costs 45 cents aday to keep. The market price for pigs is 65 cents per pound, but is falling 1 cent perday.a/ When should the pig be sold? What is the optimal profit?b/ What are the sensitivities of the optimal time and optimal profit with respect to the45-cent upcost?c/ What are the sensitivities of the optimal time and optimal profit with respect to the1-cent market depreciation?arrow_forward1. Consider an instance of the Knapsack Problem without repetitions with 4 items, having weights and values as follows. The weights (in pounds) are w1=2, w2 =7, w3 =10, w4 =12. The dollar values of these items are respectively v1 = 12, v2 = 28, v3 = 30, v4 = 5. The capacity of the knapsack is 12. (a) Find the optimal solution for Fractional Knapsack. (b) Find the optimal solution for 0-1 Knapsack.arrow_forwardSolve the following problem and find the optimal solution.arrow_forward
- Two investments with varying cash flows (in thousands of dollars) are available, as shown in the table below. At time 0, $10,000 is available for investment, and at time 1, $7,000 is available. Assuming that r 0.10, set up an LP whose solution maximizes the NPV obtained from these investments. Graphically find the optimal solution to the LP.arrow_forwardFind an optimal solution to the fractional knapsack problem for an Instance with number of items i.e n= 3, Capacity of the sack M=20, profit associated with the items (p1,p2,p3)= (25,24,15) and weight associated with each item (w1,w2,w3)= (18,15,10).arrow_forwardA construction company has four large bulldozers located at four different garages. The bulldozers are to be moved to four different construction sites. The distances in miles between the bulldozers and the construction sites are given below. Bulldozer/ A B C D Site Students 1 90 75 75 80 solve it 2 35 85 55 65 yourself 3 125 95 90 105 4 45 110 95 115 How should the bulldozers be moved to the construction sites in order to minimize the total distance traveled?arrow_forward
- Q 2: f(n) = g(n) + h(n). Discuss which thing should be optimal, underestimated, overestimated, admissible or non-admissible. What will happen if you make it monotonic? Give the example case to preserve its admissibility?arrow_forwardConsider that there are four items that can fit inside a 13-pound-capacity backpack. The respective weights of the items are 5.7, 4, and 3 pounds. Their respective utilities are 8, 11, 6, and 4 utils. Determine the optimal solution that maximizes the overall usefulness of the backpack.arrow_forwardIsn't the actual optimal S->B->G. If yes, then how are the assumed heuristics valid?arrow_forward
- A 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 [ 1= [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: Cut Profit 4 1,3 2,2 3,1 1,1,2 1,2,1 2,1,1 1,1,1,1 10 (2+8) = 10 (6+6) = 12 (8+2) = 10 (2+2+6) = 10 (2+6+2) = 10 (6+2+2) = 10 (2+2+2+2) = 8 As noted the best cut is two pieces of length 2 each to gain revenue of 6+ 6 = 12 To answer question 1, you need to do the following: 1. Write an algorithm to find the optimal cuts in order to increase the person income's 2. Implement the…arrow_forwardA book salesperson living in New York needs to visit clients in Utah, Jersey, LA, and Milan within a month. The distances between these cities are given in the table in the picture. Find the optimal solution to the problem using the branch-and-bound method.arrow_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_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