Introduction to mathematical programming
4th Edition
ISBN: 9780534359645
Author: Jeffrey B. Goldberg
Publisher: Cengage Learning
expand_more
expand_more
format_list_bulleted
Concept explainers
Expert Solution & Answer
Chapter 3.5, Problem 5P
Explanation of Solution
Formulation of LP:
Let,
Shift 1 = 12AM‑6AM
Shift 2 = 6AM‑12PM
Shift 3 = 12PM‑ 6PM
Shift 4 = 6PM‑12AM
Let
The objective of the LP is to minimize the cost of meeting the daily workforce demands of the Gotham City Police Department.
Then the LP becomes,
Minimize,
Subject to the constraints,
Expert Solution & Answer
Trending nowThis is a popular solution!
Students have asked these similar questions
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).
Six 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.
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…
Chapter 3 Solutions
Introduction to mathematical programming
Ch. 3.1 - Prob. 1PCh. 3.1 - Prob. 2PCh. 3.1 - Prob. 3PCh. 3.1 - Prob. 4PCh. 3.1 - Prob. 5PCh. 3.2 - Prob. 1PCh. 3.2 - Prob. 2PCh. 3.2 - Prob. 3PCh. 3.2 - Prob. 4PCh. 3.2 - Prob. 5P
Ch. 3.2 - Prob. 6PCh. 3.3 - Prob. 1PCh. 3.3 - Prob. 2PCh. 3.3 - Prob. 3PCh. 3.3 - Prob. 4PCh. 3.3 - Prob. 5PCh. 3.3 - Prob. 6PCh. 3.3 - Prob. 7PCh. 3.3 - Prob. 8PCh. 3.3 - Prob. 9PCh. 3.3 - Prob. 10PCh. 3.4 - Prob. 1PCh. 3.4 - Prob. 2PCh. 3.4 - Prob. 3PCh. 3.4 - Prob. 4PCh. 3.5 - Prob. 1PCh. 3.5 - Prob. 2PCh. 3.5 - Prob. 3PCh. 3.5 - Prob. 4PCh. 3.5 - Prob. 5PCh. 3.5 - Prob. 6PCh. 3.5 - Prob. 7PCh. 3.6 - Prob. 1PCh. 3.6 - Prob. 2PCh. 3.6 - Prob. 3PCh. 3.6 - Prob. 4PCh. 3.6 - Prob. 5PCh. 3.7 - Prob. 1PCh. 3.8 - Prob. 1PCh. 3.8 - Prob. 2PCh. 3.8 - Prob. 3PCh. 3.8 - Prob. 4PCh. 3.8 - Prob. 5PCh. 3.8 - Prob. 6PCh. 3.8 - Prob. 7PCh. 3.8 - Prob. 8PCh. 3.8 - Prob. 9PCh. 3.8 - Prob. 10PCh. 3.8 - Prob. 11PCh. 3.8 - Prob. 12PCh. 3.8 - Prob. 13PCh. 3.8 - Prob. 14PCh. 3.9 - Prob. 1PCh. 3.9 - Prob. 2PCh. 3.9 - Prob. 3PCh. 3.9 - Prob. 4PCh. 3.9 - Prob. 5PCh. 3.9 - Prob. 6PCh. 3.9 - Prob. 7PCh. 3.9 - Prob. 8PCh. 3.9 - Prob. 9PCh. 3.9 - Prob. 10PCh. 3.9 - Prob. 11PCh. 3.9 - Prob. 12PCh. 3.9 - Prob. 13PCh. 3.9 - Prob. 14PCh. 3.10 - Prob. 1PCh. 3.10 - Prob. 2PCh. 3.10 - Prob. 3PCh. 3.10 - Prob. 4PCh. 3.10 - Prob. 5PCh. 3.10 - Prob. 6PCh. 3.10 - Prob. 7PCh. 3.10 - Prob. 8PCh. 3.10 - Prob. 9PCh. 3.11 - Prob. 1PCh. 3.11 - Show that Fincos objective function may also be...Ch. 3.11 - Prob. 3PCh. 3.11 - Prob. 4PCh. 3.11 - Prob. 7PCh. 3.11 - Prob. 8PCh. 3.11 - Prob. 9PCh. 3.12 - Prob. 2PCh. 3.12 - Prob. 3PCh. 3.12 - Prob. 4PCh. 3 - Prob. 1RPCh. 3 - Prob. 2RPCh. 3 - Prob. 3RPCh. 3 - Prob. 4RPCh. 3 - Prob. 5RPCh. 3 - Prob. 6RPCh. 3 - Prob. 7RPCh. 3 - Prob. 8RPCh. 3 - Prob. 9RPCh. 3 - Prob. 10RPCh. 3 - Prob. 11RPCh. 3 - Prob. 12RPCh. 3 - Prob. 13RPCh. 3 - Prob. 14RPCh. 3 - Prob. 15RPCh. 3 - Prob. 16RPCh. 3 - Prob. 17RPCh. 3 - Prob. 18RPCh. 3 - Prob. 19RPCh. 3 - Prob. 20RPCh. 3 - Prob. 21RPCh. 3 - Prob. 22RPCh. 3 - Prob. 23RPCh. 3 - Prob. 24RPCh. 3 - Prob. 25RPCh. 3 - Prob. 26RPCh. 3 - Prob. 27RPCh. 3 - Prob. 28RPCh. 3 - Prob. 29RPCh. 3 - Prob. 30RPCh. 3 - Prob. 31RPCh. 3 - Prob. 32RPCh. 3 - Prob. 33RPCh. 3 - Prob. 34RPCh. 3 - Prob. 35RPCh. 3 - Prob. 36RPCh. 3 - Prob. 37RPCh. 3 - Prob. 38RPCh. 3 - Prob. 39RPCh. 3 - Prob. 40RPCh. 3 - Prob. 41RPCh. 3 - Prob. 42RPCh. 3 - Prob. 43RPCh. 3 - Prob. 44RPCh. 3 - Prob. 45RPCh. 3 - Prob. 46RPCh. 3 - Prob. 47RPCh. 3 - Prob. 48RPCh. 3 - Prob. 49RPCh. 3 - Prob. 50RPCh. 3 - Prob. 51RPCh. 3 - Prob. 52RPCh. 3 - Prob. 53RPCh. 3 - Prob. 54RPCh. 3 - Prob. 56RPCh. 3 - Prob. 57RPCh. 3 - Prob. 58RPCh. 3 - Prob. 59RPCh. 3 - Prob. 60RPCh. 3 - Prob. 61RPCh. 3 - Prob. 62RPCh. 3 - Prob. 63RP
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 coal mine purchased 3 years ago for $7 million was estimated to contain 4,000,000 tons of coal. During the past 3 years the amount of coal removed was 21,000, 18,000, and 20,000 tons, respectively. The gross income obtained in these 3 years was $257,000 for the first year, $320,000 for the second year, and $340,000 for the third year. What is the cost depletion allowance for year 1.arrow_forward. 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_forward41. A machine is purchased for P 55,000. The salvage value in 20 years is P 10,000. What is the depreciation in the first three years using straight line method? A.P 6,750 B. P6,850 C. P 6,570 D. P 6,580arrow_forward
- 5. 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_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_forwardLet S represent the amount of steel produced (in tons). Steel production is related to the amount of labor used (L) and the amount of capital used (C) by the following function: S = 35L0.40 0.60 In this formula L represents the units of labor Input and C the units of capital input. Each unit of labor costs $150, and each unit of capital costs $200. a. Formulate an optimization problem that will determine how much labor and capital are needed in order to produce 60,000 tons of steel at minimum cost. If the constant is "1" it must be entered in the box; if your answer is zero, enter "0". Min s.t. L C L, C b. Solve the optimization problem you formulated in part (a). Hint: Use the Multistart option as described in Appendix 8.1. Add lower and upper bound constraints of 0 and 5000 for both L and C before solving. Round your answers for L and C to three decimal places. Round your answer for optimal solution to one decimal place. L= and C= for an optimal solution of $. Please do…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