Operations Research : Applications and Algorithms
4th Edition
ISBN: 9780534380588
Author: Wayne L. Winston
Publisher: Brooks Cole
expand_more
expand_more
format_list_bulleted
Expert Solution & Answer
Chapter 5.2, Problem 1P
Explanation of Solution
a.
Profit
- Here 40 acres of land are available and the allowable decrease is 6.6667acres.
- Thus the current basis remains optimal.
- The shadow price for the constraint is 75.
- Hence the new optimum solution is
Explanation of Solution
b.
Optimal solution
- Optimal solution is still to plant 25 acres of wheat and 20 acres of corn and use 350 labor hours.
- The new profit is
Explanation of Solution
c.
Allowable increase and Allowable decrease
- In this case allowable decrease is the slack value which is 15.
- The allowable increase value is infinity...
Expert Solution & Answer
Trending nowThis is a popular solution!
Students have asked these similar questions
A farmer is planning to raise wheat and barley. Each acre of wheat yields a profit of $50, and each acre of barley yields a profit of $70. To sow the crop, two machines, a tractor and a tiller are rented. The tractor is available for 150 hours, and the tiller is available for 200 hours. Sowing an acre of wheat requires 4 hours of tractor time and 1 hour of tilling. Sowing an acre of barley requires 3 hours of tractor time and 2 hours of tilling. How many acres of each crop should be planted to maximize the farmer’s profit? (Let W be the number of acres of wheat to be planted, B the number of acres of barley to be planted and P the profit) What is the objective function for the problem? Excluding the non-negative constraint, how many constraints does the problem have? What is the linear programming model of the problem? In the initial tableau, what is the leaving variable? What is the pivot element in the initial tableau? What is the optimal solution to the problem? After how many…
John is training for a marathon and he can easily alternate between running a mile and walking a mile. If he runs for 2 miles in a row, he becomes fatigued, and must then walk for 2 miles in a row in order to no longer be fatigued. When he is fatigued, he can still alternate between running a mile and walking a mile, but if he runs 2 miles in a row while already fatigued, he will collapse on the side of the road. If he runs 3 miles in a row at any point, he will also collapse. Let the letter 'a' stand for John running 1 mile, and the letter 'b' stand for John walking 1 mile. Draw a DFA which accepts all possible runs in which John does not collapse on the side of the road.
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 =…
Chapter 5 Solutions
Operations Research : Applications and Algorithms
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
- . Employees of a certain firm are paid on hourly basis at the end of each week. If an employee works up to 40hrs, the employee is paid 6 GHS and 7 GHS per hour for a male and female respectively. If an employee works for more than 50 hours then the employee is also paid 2.5 the corresponding regular rate for hours worked in excess of 40. All employees are to pay 10 % of their gross as INCOME TAX and 2.5% towards the NHIS. If an employee has more than 3 children then he or she pays 2 cedis per child in excess of three towards GETFUND. Write a C++ program that can print onto screen the Net Salary of any staff onto screen. NB (NETSALARY is equal to gross salary less all deductions (VAT, NHIS, GETFUND). Write a C++ program and draw a flow chart for a software solution that can solve for the problem above.arrow_forwardYou are given some tasks of size xK, yK and zK respectively and there are at most 9 tasks each. Determine the best that you could achieve if you are to fill up a hole of size SK, for the following values of x, y, z and S, by maximizing the space used (up to S), i.e. minimizing the used space, if any. Show how many tasks of size x, how many tasks of size y and how many tasks of size z are used in each of the three cases. (g) Now if we relax the requirement so that there are no upper limits on the number of tasks for each type, determine the maximal space usage and the task mix. (h) If we tighten the requirement so that there are still at most 9 tasks of each size, but we also require that each type of tasks must be used at least once, determine maximal space usage and the task mix. Case 1 2 3 X 22 26 28 y 33 43 65 50 77 74 S 488 556 777 You could complete the following table. Fill in the number of tasks inside the brackets and the corresponding maximal usage. (At most 9 tasks each (g)…arrow_forward5. A farmer in Georgia must decide which crop to plant next year on his land: corn, peanuts, or soybeans. The return from each crop will be determined by whether a new trade bill with Russia passes the Senate. The profit the farmer will realize from each crop, given the two possible results on the trade bill, is shown in the following payoff table: Course Professor Fulton Ray Scott Crop Trade Bill Pass Fail Corn Peanuts Soybeans $35,000 $ 8,000 18,000 12,000 22,000 20,000 Determine the best crop to plant, using the following decision criteria. a. Maximax b. Maximin c. Minimax regret d. Hurwicz (a = .3) e. Equal likelihoodarrow_forward
- IKEO is a furniture manufacturer which produces two sizes of wood blocks (type A and B) thatare used to make either a table or a chair. A table is made of a type A and a type B wood blocks,while a chair is made of a type A and two type B wood blocks.A table makes RM 3 profit, and a chair makes RM 5 profit. If M number of type A and Nnumber of type B wood blocks are produced, how many tables and chairs should themanufacturer make to obtain the greatest profit?For example, let M = 12 and N = 12.By making 4 tables (4 type A and 4 type B) and 4 chairs (4 type A and 8 type B), themanufacturer gain profit as follows,Profit = (RM 3) × 4 + (RM 5) × 4 = RM 32.If the manufacturer makes 2 more tables and 1 less chair, the profit will be increased as follows,Profit = (RM 3) × 6 + (RM 5) × 3 = RM 33.Is this the greatest profit?Write a complete C++ program to help the manufacturer determine the greatest profit obtainfrom making tables and chairs with a given number of M type A and N type B wood…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_forwardA circus is planning a tower act in which individuals stand on top of one another's shoulders. Each individual must be both shorter and lighter than the person below him or her for practical and aesthetic reasons. Write a way to determine the maximum feasible number of people in such a tower given the heights and weights of each individual in the circus.arrow_forward
- A company uses four special tank trucks to deliver four different gasoline products to customers. Eachtank has five compartments with capacities: 500, 750, 1200, 1500, and 1750 gallons. The daily demands forthe four products are 10000, 15000, 12000, and 8000 gallons. Any quantities that cannot be delivered by thecompany’s four trucks must be subcontracted at the additional costs of 5, 12, 8, and 10 cents per gallon forproducts 1, 2, 3, and 4, respectively. The goal is to develop the optimal daily loading schedule for the fourtrucks that will minimize the additional cost of subcontracting. Formulate this problem as an integer linearprogram, and solve it (not by hand).arrow_forwardYou have a five-quart jug, a three-quart jug, and an unlimited supply of water (butno measuring cups). How would you come up with exactly four quarts of water? Note that the jugs are oddly shaped, such that filling up exactly "half" of the jug would be impossible.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