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
Question
error_outline
This textbook solution is under construction.
Students have asked these similar questions
At 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 =…
In a lake, the population of a particular fish species is about 1 million. Fish reproduce by 20% of the population each month, regardless of the season. In addition, fish die naturally after living for an average of 10 months. There are two separate companies (for example, A and B) fishing with 5 boats on the edge of this lake. According to current data, each boat catches 5000 fish per month. However, if the total number of boats caught in the lake increases, the number of fish to be caught by each boat decreases, as the boats will prevent each other from fishing. In addition, if the fish population in the lake increases, the fish caught per boat increases, and if the population decreases, the fish caught per boat decreases. As companies earn money from hunting, they want to buy new boats over time and enlarge their boat fleet.
In a lake, the population of a particular fish species is about 1 million. Fish reproduce by 20% of the population each month, regardless of the season. In addition, fish die naturally after living for an average of 10 months. There are two separate companies (for example, A and B) fishing with 5 boats on the edge of this lake. According to current data, each boat catches 5000 fish per month. However, if the total number of boats caught in the lake increases, the number of fish to be caught by each boat decreases, as the boats will prevent each other from fishing. In addition, if the fish population in the lake increases, the fish caught per boat increases, and if the population decreases, the fish caught per boat decreases. As companies earn money from hunting, they want to buy new boats over time and enlarge their boat fleet.
Indicate the causal relationships in this system with arrows and signs.
Show the causality loops in this system, at least 1 negative, at least 1 positive, and…
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 group of n tourists must cross a wide and deep river with no bridge in sight. They notice two 13-year-old boys playing in a rowboat by the shore. The boat is so tiny, however, that it can only hold two boys or one tourist. How can the tourists get across the river and leave the boys in joint possession of the boat? How many times need the boat pass from shore to shore?arrow_forwardDepartment 3 has 2500 hours. Transfers are allowed to departments 2 and 4, and from departments 1 and 2. If Ai measures the labor hours allocated to department i and Tij the hours transferred from department i to department j, then a.T13 + T23 − T32 − T34 − A3 = 2500. b.A3 + T13 + T23 − T32 − T34 = 2500. c.T31 + T32 − T23 − T43 + A3 = 2500. d.A3 − T13 − T23 + T32 + T34 = 2500.arrow_forwardSuppose that the grading of x University courses is as follows:• Each student can get grades between 0 and 100.• If the student's grade is less than 40, the student is informed that the course failed (Unsuccessful).• If the student's grade is higher than 40,o The difference between the student's current grade and the number that is a multiple of 5 higher than the closest to his / her grade is less than 3.If it is lower, the student's grade is equal to the 5 fold higher than the closest one.o If the difference is 3 or more than 3, no change is made in the grade of the student.In this context, the updated grades of the students are calculated according to the entered student gradesWrite the Java code showing.Solve this question in c ++ language.ü Define the section to be calculated as Java object ("Question1").ü Question1; Take the note string as input.public Question1 (int [] input)ü Print out the updated notes as a series after the calculation is madeo public int [] gradingStudents…arrow_forward
- Suppose that the grading of x University courses is as follows:• Each student can get grades between 0 and 100.• If the student's grade is less than 40, the student is informed that the course failed (Unsuccessful).• If the student's grade is higher than 40,o The difference between the student's current grade and the number that is a multiple of 5 higher than the closest to his / her grade is less than 3.If it is lower, the student's grade is equal to the 5 fold higher than the closest one.o If the difference is 3 or more than 3, no change is made in the grade of the student.In this context, the updated grades of the students are calculated according to the entered student gradesWrite the Java code showing.ü Define the section to be calculated as Java object ("Question1").ü Question1; Take the note string as input.public Question1 (int [] input)ü Print out the updated notes as a series after the calculation is madeo public int [] gradingStudents ()Code sample:public class Question1…arrow_forwardA ski rental agency has n pairs of skis, where the height of the the ith pair of skis is si . There are n skiers who wish to rent skis, where the height of the ith skier is hi. Ideally, each skier should obtain a pair of skis whose height matches her/his own height as closely as possible. We would like to assign skis to skiers so that the sum of the absolute differences of the heights of each skier and her/his skis is minimized. Design a greedy algorithm for the problem. Prove the correctness of your algorithm. (Hint: Start with two skis and two skiers. How would you match them? Continue to three skis and three skiers, and identify a strategy.)arrow_forwardSix months before its annual convention, the AmericanMedical Association must determine how many rooms toreserve. At this time, the AMA can reserve rooms at a costof $50 per room. The AMA must pay the $50 room costeven if the room is not occupied. The AMA believes that thenumber of doctors attending the convention will be normallydistributed, with a mean of 5,000 and a standard deviationof 1,000. If the number of people attending the conventionexceeds the number of rooms reserved, extra rooms must bereserved at a cost of $80 per room. Use simulation todetermine the number of rooms that should be reserved tominimize the expected cost to the AMA.arrow_forward
- write a linear integer programming of the below problem Formulate the following manpower planning problem in mathematical programming terms.Given a set of workers and a set of 15 working hours per day with a required staffing per hour. Determinethe minimum number of people required to cover the workload requirements, knowing that a personworks in shifts that cover 7 hours and a person starting in hour contributes to the workload in hoursi,........,i+ 6 (eg: a person starting in hour 3 contributes to the workload in hours 3,4,5,6,7,8,9).arrow_forwardThere are a number of plants in a garden. Each of the plants has been treated with some amount of pesticide. After each day, if any plant has more pesticide than the plant on its left, being weaker than the left one, it dies. You are given the initial values of the pesticide in each of the plants. Determine the number of days after which no plant dies, i.e. the time after which there is no plant with more pesticide content than the plant to its left. Example // pesticide levels Use a -indexed array. On day , plants and die leaving . On day , plant in dies leaving . There is no plant with a higher concentration of pesticide than the one to its left, so plants stop dying after day . Input Format The first line contains an integer , the size of the array .The next line contains space-separated integers . Constraints Sample Input 7 6 5 8 4 7 10 9 Sample Output 2 Explanation Initially all plants are alive. Plants = {(6,1), (5,2), (8,3), (4,4), (7,5),…arrow_forward2. A safe has 5 locks v, w, y and z; all of which must be unlocked for the safe to open. The keys to the locks are distributed among five executives in the following manner.Mr. A has keys for locks v and x. Mr. B has keys for locks v and y. Mr. C has keys for locks w and y. Mr. D has keys for locks x and z. Mr. E has keys for locks v and z.a) Determine the minimal number of executives required to open the safe.b) Find all the combinations of executives that can open the safe; write and expression f(A, B, C, D, E) which specifies when the safe can be opened as a function of what executives are present.c) Who is the essential executive?arrow_forward
- (Do it on R)(using Pnorm) The loaves of rye bread distributed to local stores by a certain bakery have an average length of 30 centimeters and a standard deviation of 2 centimeters. Assuming that the lengths are normally distributed, what percentage of the loaves are (a) longer than 31.7 centimeters? (b) between 29.3 and 33.5 centimeters in length? (c) shorter than 25.5 centimeters?arrow_forwardPlease show written work with answer!! Given a rod of length n inches and a table of prices pi for I = 1, 2, …, n, use dynamic programming to determine the maximum revenue rn obtainable by cutting up the rod.arrow_forwardRecall Pigou’s example discussed in class, where there are two roads that connect a source, s, and destination, t. The roads have different travel costs. Fraction x1 of the traffic flow on route 1, and the remainder x2 on route 2. Here consider the following scenario. • The first road has “infinite” capacity but is slow and requires 1 hour travel time, T1 = 1. • The second road always requires at least 15 mins, which then increases as a function of traffic density, T2 = 0.25 + 0.75x2. If drivers act in a “selfish” manner – the user optimal scenario – all the traffic will flow on the second path, as one is never worse off. Worst case scenario for path 2, both paths take one hour. So no one is incentivized to change their behavior. 1. Assume user optimal behavior, and calculate τ the expected travel time per car. 2. If instead we could control the flows, we could minimize the expected travel time. Using the expression in part (a), calculate the optimal allocation of flows x¯1 and ¯x2…arrow_forward
arrow_back_ios
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