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
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
You wish to drive from point A to point B along a highway minimizing the time that
you are stopped for gas. You are told beforehand the capacity C of you gas tank in liters,
your rate F of fuel consumption in liters/kilometer, the rate r in liters/minute at which you
can fill your tank at a gas station, and the locations A = x1, ··· , B = xn of the gas stations
along the highway. So if you stop to fill your tank from 2 liters to 8 liters, you would have
to stop for 6/r minutes. Consider the following two algorithms:
(a) Stop at every gas station, and fill the tank with just enough gas to make it to the next
gas station.
(b) Stop if and only if you don’t have enough gas to make it to the next gas station, and
if you stop,fill the tank up all the way.
For each algorithm either prove or disprove that this algorithm correctly solves the problem.
Your proof of correctness must use an exchange argument.
At the beginning of the first day (day 1) after grape harvesting is completed, a grapegrower has 8000 kg of grapes in storage. At the end of day n, for n = 1, 2, . . . , the grape grower sells 250n/(n + 1) kg of their stored grapes at the local market at the price of $1.50 per kg.During each day the stored grapes dry out a little so that their weight decreases by 2%.Let wn be the weight (in kg) of the stored grapes at the beginning of day n for n ≥ 1.Find a recursive definition for wn. Draw a timeline. Find the value of wn for n = 1, 2, 3. Let rn be the total revenue (in dollars) earned from the stored grapes from the beginning of day 1 up to the beginning of day n for n ≥ 1.Write a program to compute wn and rn for n = 1, 2, . . . , num where num is entered by the user, and display the values in three columns: n, wn, rn with appropriate headings.Run the program for num = 20. (Use format bank.) Use program to determine how many days it will take to sell all of the grapes.//This is all…
1. Prove the following formulas log X < X for all X > 0
Chapter 18 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
- You are an investor who receives daily price quotes for a stock. The span of a stock's price on a given day is the number of consecutive days, from the given day going backwards, on which its price was less than or equal to its price on the day we are considering. Thus, the Stock Span Problem is as follows: Given a series of daily price quotes for a stock, find the span of the stock on each day of the series. Assume you are given seven daily stock quotes: 3, 10, 4, 7, 9, 6, and 8. Assume further that these stock quotes are stored in the array quotes. Show a step-by-step, manual desk-check execution of the algorithm below showing the values of all variables and arrays for each step in each cycle of each loop, as demonstrated in clase Algorithm: A Simple Stock Span Algorithm SimpleStockSpan (quotes) → spans Input: quotes, an array with n stock price quotes Output: spans, an array with n stock price spans 2 3 4 5 6 7 8 10 11 spans CreateArray (n) ← for i0 to n do k 1 span_end FALSE while…arrow_forward2. A whisky distiller named Taketsuru Masataka puts 8000L of whisky into barrels for aging, with 200L of whisky per barrel. Each year the volume of whisky in each barrel reduces by 2% due to evaporation (this is known as the angels' share). For the first 11 years after barreling, Taketsuru sells 2 barrels for 20 dollars per litre at the end of each year. Write bn for for the volume of whisky in each barrel at the beginning of year n, write Un for the total volume of whisky in storage at the beginning of year n, and rn for the total revenue from selling whisky at the beginning of year n. (a) Find a direct formula for bn. (b) Calculate the values of v₁, v2, V3 and then find a recursive definition for Un. (c) Find a recursive definition for rn. (d) Write a MATLAB program to compute Un and rn for n = 1, 2 ... 12 and display the values in three columns n, rn, Un with appropriate headings. (e) At the end of the 12th year Taketsuru finds that he can sell 12-year old whisky at the higher price…arrow_forwardYou are an investor who receives daily price quotes for a stock. The span of a stock's price on a given day is the number of consecutive days, from the given day going backwards, on which its price was less than or equal to its price on the day we are considering. Thus, the Stock Span Problem is as follows: Given a series of daily price quotes for a stock, find the span of the stock on each day of the series. Assume you are given seven daily stock quotes: 3, 10, 4, 7, 9, 6, and 8. Assume further that these stock quotes are stored in the array quotes. Show a step-by-step, manual desk-check execution of the algorithm below showing the values of all variables and arrays for each step in each cycle of each loop, as demonstrated in clase Algorithm: A Simple Stock Span Algorithm SimpleStockSpan (quotes) spans Input: quotes, an array with n stock price quotes Output: spans, an array with n stock price spans 1 spans CreateArray (n) 2 for i-0 to n do k+1 span_endFALSE while i-k 20 and not…arrow_forward
- 5. solve with step max in 30-45 minutes thank u The Marriage Law says that a marriage is said to be valid if there is no sibling relationship. Mr. Yoyok has children Ani and his wife is dead. Mrs. Tatik has a child Tedi and her husband already die. One day, Mr. Yoyok and Mrs. Tatik got married and Ani got acquainted with Tedi and plans to get married too. Prove it using the methodinference that Ani and Tedi's marriage is legalarrow_forward- The bucket has a weight of 400 N and is being hoisted using three springs, each having an unstretched length of 6 = 0.45 m and stiffness of k = 800 N/m. Determine the vertical distance d from the rim to point A for equilibrium. 400 N D. 120 120° 0.45 m 120° B 3d EF, = 0; 400 – F = 0 d² + (0.45)² 400 N 3d [800 Jd² + (0.45)² -0.45)] = 0 400 d² + (4.5)² |d² + (0.45)² -0.45) = 0.16667 0.45 m d² + (4.5)² d d² + (0.45)² -0.45 d = 0.16667 Jd² + (0.45)² Va? + (0.45)² (d– 0.16667) = 0.45 0.45 m d [d² + (0.45)*] [d° – 2d(0.16667) + (0.16667)°] = (0.45)² d² d* – 0.33334 d + 0.027779 d – 0.0675 d + 0.0056252 = 0 120° 0.45 m d = 0.502 m Ansarrow_forwardAt the beginning of the first day (day 1) after grape harvesting is completed, a grape grower has 8000 kg of grapes in storage. On day n, for n = 1, 2, . . . ,the grape grower sells 250n/(n + 1) kg of the grapes at the local market at the priceof $2.50 per kg. He leaves the rest of the grapes in storage where each day they dryout a little so that their weight decreases by 3%. Let wn be the weight (in kg) ofthe stored grapes at the beginning of day n for n ≥ 1 (before he takes any to themarket).(a) Find the value of wn for n = 2.(b) Find a recursive definition for wn. (You may find it helpful to draw a timeline.)(c) Let rn be the total revenue (in dollars) earned from the stored grapes from thebeginning of day 1 up to the beginning of day n for n ≥ 1. Find a recursiveformula for rn.(d) Write a MATLAB program to compute wn and rn for n = 1, 2, . . . , num wherenum is entered by the user, and display the values in three columns: n, wn, rnwith appropriate headings.Run the program for num =…arrow_forward
- The public utilities commission has decided that the electric company overcharged its customers for two months last year. To make up the difference to the customers, the commission orders the company to decrease each of the next month’s bills by 10%. The city also levies a 3%utility tax, which is to be applied to the bill before it is discounted. Also, the10% discount does not apply to the utility tax. Assume electricity costs $0.16per kilowatt-hour. Write a program to compute the next month’s electricity bill given the number of kilowatt-hours consumed as inputarrow_forwardThe world monarch in the new post-apocalyptic world is extremely worried about the birth rate. She therefore orders that every family must have at least one female or else pay hefty fines. What will the gender ratio of the next generation be if all families adhere to this policy, which requires them to keep having children until they have one girl, at which time they immediately stop? (Presume that all pregnancies have an equal chance of producing a male or a girl.) Write a computer simulation of this problem after you have rationally resolved it.arrow_forwardConsider nonnegative integer solutions of the equation x1+x2+x3+x4+x5+x6=30. How many different solutions are there? How many solutions also satisfy: for every i∈{1,2,3,4,5,6}, xi is positive and even?arrow_forward
- Four individuals wish to traverse an unstable bridge; they all start on the same side. You have 17 minutes to get everyone to the opposite side. Night has fallen, and they have only one torch. Two individuals may cross the bridge at once at most. Any crossing party, whether one or two individuals, must carry a torch. The torch must be carried back and forth; it cannot, for instance, be hurled. Person 1 crosses the bridge in one minute, person 2 in two minutes, person 3 in five minutes, and person 4 in ten minutes. A dyad must trek together at the slower individual's cadence. Create the algorithm specification that solves the problem.arrow_forwardEach year a certain amount of money is deposited in an account which pays an annual interest rate of are so that at the end of the year the balance in the account is multiplied by a growth factor of X equals 2+ R. $500 is deposited at the start of the first year, an additional 200 is deposited at the start of the second year, and 600 and start of the following yeararrow_forwardInformation on morphine: Morphine can be administered via injection / IV. The quantity of morphine in a given dose may vary, but one guideline is to use 0.1 mg of morphine for each kg of the patient's body mass. The time taken for half the quantity of morphine to be removed from the body is 2 hours. An exponential function can be used to model the amount of morphine in the body over time: ?=?0???A=A0ekt (note that ?k will be negative). Calculate the value of ?k for morphine. Write a Python function called MorphineModel, which takes two arguments: dose amount ?0A0 and time since last dose ?t, and returns the amount of morphine in the body at this time ?t. Add to your computer code so that you have a program which is an implementation of the following flowchart. Ensure that your code is well-communicated to a user of the program (via the print statements) and well-communicated to someone reading the code (via comments).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