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 16.8, Problem 3P
Explanation of Solution
True or False case:
If we have optimal (R, S) policy for the back-ordered case and S=50, then it is true that optimal S for the lost sales case has S>50.
- For the (R, S) policy, the order level S is set t...
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
Isn't the actual optimal S->B->G. If yes, then how are the assumed heuristics valid?
True/False: For a given Markov decision process, in order to extract the optimal policy π∗,it is sufficient to know the transition function T(s,a,s′) and optimal value function V ∗.If false, explain why this is false. If true, explain how to extract the policy.
In an optimal A* search,
a- describe the problem of a heuristic function that overestimates the cost. How
does it effect the solution? Give an example.
b-is a heuristic method that underestimates the cost admissible? How does it effect
the solution? Give an example
Chapter 16 Solutions
Operations Research : Applications and Algorithms
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
- Please provide the optimal policy. If there is a tie, always choose the state with the smallest indexarrow_forwardConsider the following 0-1 knapsack problem, the items, their weights and their profits appear in table below. If the knapsack has capacity 11 select the items that appear in the solution? i.e. select answers 1, 2,and 3 if those are the items in the optimal knapsack. Item 2 3 5 6 Weight 1 2 3 4 5 6 Profit 10 13 15 U item 1 U item 2 U item 3 U item 4 U item 5 U item 6 O O O O O Oarrow_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_forward
- 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.arrow_forwardSuppose 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?arrow_forwardGiven the figure below, using the Greedy-Best First search find ifit is optimal /admissible or not? Explain why?arrow_forward
- Trace the dynamic programming algorithm for the change-making problem for the denominations 1, 2, 4, 5 and the amount n 11. Fill all the table values, and list all the optimal solutions. =arrow_forwardThe monotone restriction (MR) on the heuristic function is defined as h (nj ) 2 h (ni ) - c (ni , nj ). Please prove the following: 1. If h(n)arrow_forwardA given Knapsack with maximal Weight capacity is 8Kg. There are some items can be chosen and taken into Knapsack. Each item has own weight and profit shown as follows. Please find the maximal profit of Knapsack after some items are selected and put into this Knapsack and its maximal Weight capacity isn't exceeded. item ID Weight 4Kg 5Kg 2Kg 1kg 6Kg A B C D E Profit 4500 5700 2250 1100 6700 The maximal profit of this Knapsack to taken some items and total weight is no exceeded the weight capacity : The last item is taken and put into this Knapsack is : The second item is taken and put into this Knapsack is : The first item is taken and put into this Knapsack is:arrow_forwardplease i need corect answear 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). Find an optimal solution to the fractional knapsack problem for anarrow_forwardA ticket from Indianapolis to Orlando on DeleastAirlines sells for $150. The plane can hold 100 people. Itcosts $8,000 to fly an empty plane. The airline incurs variablecosts of $30 (food and fuel) for each person on the plane.If the flight is overbooked, anyone who cannot get a seatreceives $300 in compensation. On the average, 95% of allpeople who have a reservation show up for the flight. Tomaximize expected profit, how many reservations for theflight should be taken by Deleast? (Hint: The @Riskfunction RISKBINOMIAL can be used to simulate thenumber of passengers who show up. If the number ofreservations taken is in cell A2, then the formulaRISKBINOMIAL(A2,.95)will generate the number of customers who actually showup for a flight!)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_forwardarrow_back_iosSEE MORE QUESTIONSarrow_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