Practical Management Science
6th Edition
ISBN: 9781337406659
Author: WINSTON, Wayne L.
Publisher: Cengage,
expand_more
expand_more
format_list_bulleted
Concept explainers
Question
Chapter 6.5, Problem 33P
Summary Introduction
To modify: The model and find the optimal solution using solver.
Introduction: The variation between the present value of the
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
Formulate and then solve a linear programming model of this problem, to determine how manycontainers of each product to produce tomorrow to maximize profits. The company makes fourjuice products using orange, grapefruit, and pineapple juice.Product Retail Price per QuartOrange juice $1.00Grapefruit juice .90Pineapple juice .80All-in-One 1.10The All-in-One juice has equal parts of orange, grapefruit, and pineapple juice. Each product isproduced in a one-quart size (there are four quarts in a gallon). On hand are 400 gallons of orangejuice, 300 gallons of grapefruit juice, and 200 gallons of pineapple juice. The cost per gallon is$2.00 for orange juice, $1.60 for grapefruit juice, and $1.40 for pineapple juice.In addition, the manager wants grapefruit juice to be used for no more than 30 percent of thenumber of containers produced. She wants the ratio of the number of containers of orange juice tothe number of containers of pineapple juice to be at least 7 to 5.
A call center employs 1,425 agents. Every month 57 employees leave the company and 57 new employees are hired.
a. How long on average does an agent work for this call center (in months)
Suppose the cost of hiring and training a new agent is $1,140. The manager of this call center believes that increasing agents’ salaries would keep them working longer at the company. The manager wants to increase the average time that an agent works for the call center to 36 months, or three years.
b-1. Given the current average working time for agents at this call center, determine the current annual cost for hiring and training.
b-2. Assuming the average time that an agent works for the call center is increased to 36 months, determine the new annual cost for hiring and training.
b-3. If the time an agent works for the call center is increased to 36 months on average, how much could the company save on hiring and training costs over a year?
A person starting in Columbus must visit Great Falls, Odessa, and Brownsville, and then return home to Columbus in one car trip. The road mileage between the cities is shown.
Columbus
Great Falls
Odessa
Brownsville
Columbus
---
102
79
56
Great Falls
102
---
47
69
Odessa
79
47
---
72
Brownsville
56
69
72
---
a)Draw a weighted graph that represents this problem in the space below. Use the first letter of the city when labeling each
b) Find the weight (distance) of the Hamiltonian circuit formed using the nearest neighbor algorithm. Give the vertices in the circuit in the order they are visited in the circuit as well as the total weight (distance) of the circuit.
Chapter 6 Solutions
Practical Management Science
Ch. 6.3 - Prob. 1PCh. 6.3 - Prob. 2PCh. 6.3 - Solve Problem 1 with the extra assumption that the...Ch. 6.3 - Prob. 4PCh. 6.3 - Prob. 5PCh. 6.3 - Prob. 6PCh. 6.3 - Prob. 7PCh. 6.3 - Prob. 8PCh. 6.3 - Prob. 9PCh. 6.3 - Prob. 10P
Ch. 6.4 - Prob. 11PCh. 6.4 - Prob. 12PCh. 6.4 - Prob. 13PCh. 6.4 - Prob. 14PCh. 6.4 - Prob. 15PCh. 6.4 - Prob. 16PCh. 6.4 - Prob. 17PCh. 6.4 - Prob. 18PCh. 6.4 - Prob. 19PCh. 6.4 - Prob. 20PCh. 6.4 - Prob. 21PCh. 6.4 - Prob. 22PCh. 6.4 - Prob. 23PCh. 6.5 - Prob. 24PCh. 6.5 - Prob. 25PCh. 6.5 - Prob. 26PCh. 6.5 - Prob. 28PCh. 6.5 - Prob. 29PCh. 6.5 - Prob. 30PCh. 6.5 - In the optimal solution to the Green Grass...Ch. 6.5 - Prob. 32PCh. 6.5 - Prob. 33PCh. 6.5 - Prob. 34PCh. 6.5 - Prob. 35PCh. 6.6 - Prob. 36PCh. 6.6 - Prob. 37PCh. 6.6 - Prob. 38PCh. 6 - Prob. 39PCh. 6 - Prob. 40PCh. 6 - Prob. 41PCh. 6 - Prob. 42PCh. 6 - Prob. 43PCh. 6 - Prob. 44PCh. 6 - Prob. 45PCh. 6 - Prob. 46PCh. 6 - Prob. 47PCh. 6 - Prob. 48PCh. 6 - Prob. 49PCh. 6 - Prob. 50PCh. 6 - Prob. 51PCh. 6 - Prob. 52PCh. 6 - Prob. 53PCh. 6 - Prob. 54PCh. 6 - Prob. 55PCh. 6 - Prob. 56PCh. 6 - Prob. 57PCh. 6 - Prob. 58PCh. 6 - Prob. 59PCh. 6 - Prob. 60PCh. 6 - Prob. 61PCh. 6 - Prob. 62PCh. 6 - Prob. 63PCh. 6 - Prob. 64PCh. 6 - Prob. 65PCh. 6 - Prob. 66PCh. 6 - Prob. 67PCh. 6 - Prob. 68PCh. 6 - Prob. 69PCh. 6 - Prob. 70PCh. 6 - Prob. 71PCh. 6 - Prob. 72PCh. 6 - Prob. 73PCh. 6 - Prob. 74PCh. 6 - Prob. 75PCh. 6 - Prob. 76PCh. 6 - Prob. 77PCh. 6 - Prob. 78PCh. 6 - Prob. 79PCh. 6 - Prob. 80PCh. 6 - Prob. 81PCh. 6 - Prob. 82PCh. 6 - Prob. 83PCh. 6 - Prob. 84PCh. 6 - Prob. 85PCh. 6 - Prob. 86PCh. 6 - Prob. 87PCh. 6 - Prob. 88PCh. 6 - Prob. 89PCh. 6 - Prob. 90PCh. 6 - Prob. 91PCh. 6 - Prob. 92PCh. 6 - This problem is based on Motorolas online method...Ch. 6 - Prob. 94PCh. 6 - Prob. 95PCh. 6 - Prob. 96PCh. 6 - Prob. 97PCh. 6 - Prob. 98PCh. 6 - Prob. 99PCh. 6 - Prob. 100PCh. 6 - Prob. 1CCh. 6 - Prob. 2CCh. 6 - Prob. 3.1CCh. 6 - Prob. 3.2CCh. 6 - Prob. 3.3CCh. 6 - Prob. 3.4CCh. 6 - Prob. 3.5CCh. 6 - Prob. 3.6C
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, operations-management and related others by exploring similar questions and additional content below.Similar questions
- TRUE OR FALSE Each constraint excluding nonnegativity constraints, in the mathematical formulation of a linear program generates one row in the simplex table.arrow_forwardA public hospital employs volunteers to attend the reception between 8:00 A.M. and 10:00 P.M. Each volunteer works three consecutive hours, except those who enter at 8:00 P.M., who only work 2 hours. An approximation to the minimum need for volunteers is through a staggered function in two-hour intervals, which start at 8:00 A.M. and they are 4, 6, 8, 6, 4, 6 and 8 volunteers per interval. As most of the volunteers are pensioners, they are willing to offer their services at any time of the day (8:00 A.M. to 10:00 P.M.). However, as most charities compete for your services, the amount required should be kept as low as possible. Determine an optimal schedule of start time and number of volunteers.arrow_forwardConsider a school district with I neighborhoods, J schools, and G grades at each school. Each school j has a capacity of C jg for grade g. In each neighborhood i , the student population of grade g is S ig. Finally, the distance of school j from neighborhood i is dij . Formulate a linear programming problem whose objective is to assign all students to schools, while minimizing the total distance traveled by all students. (You may ignore the fact that numbers of students must be integer).arrow_forward
- Which of the following is true regarding the linear programming formulation of a transportation problem that doesn't have any unacceptable routes? The number of constraints is calculated as number of origins times number of destinations. The constraints' left-hand-side coefficients are less than zero. The objective function value is either 0 or 1. The number of variables is calculated as number of origins times number of destinations.arrow_forwardIn a metropolitan area, 45,000 people want to travel from the city suburbs to the city center. To do so, they can drive, take a city bus, or use the subway system. Ifx1 number of people drive and x2 number of people take a bus, it will take respectively (0.0006 x1 + 30) and (0.0003 x2 + 40) minutes to make the trip;whereas a subway trip is expected to take 45 minutes. The city bus system can transport a maximum of 20,000 people to the city center, while the subway systemhas a capacity of transporting at most 10,000. Write a programming formulation that minimizes the average travel time for each person.arrow_forwardWe are in a M/M/1/3 queueing system in which we wish to determine the cost of operating the system. Each customer in the queue costs us $100 per hour and each customer being served costs us $50 an hour. Customers arrive at a rate of 4 per hour and the server can serve customers at a rate of 5 per hour. The following table in the picture provides Pn values, W, and Wq:arrow_forward
- Consider the network revenue management model. Suppose that the fare prices are constant (deterministic), that is they are as shown in the first image below of Rt. Let D ∈ ℝ^n be a vector with components Dj = E[t=1 to T∑(Rt,j/rj)]. Show that the optimal value of the program with variable y ∈ ℝ^n is equal to J˜^µ∗T(x). In addition, the optimal dual solution of the capacity constraints of the previous deterministic linear program is an optimal solution of the problem min µ≥0 J˜µT(x). The program in question is the following: max (r^⊺)y,s.t. Ay ≤ x,0 ≤ y ≤ Darrow_forwardSuppose you own 11 bronze coins worth a total of $150,11 silver coins worth a total of $160, and 11 gold coinsworth a total of $170. Develop a linear integer model tofind a combination of coins worth exactly $110arrow_forwardSearch for the best solution of the following integer program using the branch and bound algorithm.arrow_forward
- Federated Oil has refineries in Los Angeles and Chicago. The Los Angeles refinery can refine up to two million barrels of oil per year, and the Chicago refinery up to three million. After the oil is refined, it is shippedto two distribution points, Houston and New York City. Federated Oil estimates that each distribution point can sell up to five million barrelsper year. Because of differences in shipping and refining costs, the profit earned (in dollars) per million barrels of oil shipped depends on where the oil was refined and on the point of distribution. This information is listed in the file P04_69.xlsx. The company is considering expanding the capacity of each refinery.Each million barrels of annual refining capacity that isadded will cost $120,000 for the Los Angeles refinery and $150,000 for the Chicago refinery. Determine how Federated Oil can maximize its profit (including expansion costs) over a 10-year period.arrow_forwardA company supplies goods to three customers, who eachrequire 30 units. The company has two warehouses.Warehouse 1 has 40 units available, and warehouse 2 has 30units available. The costs of shipping 1 unit from warehouseto customer are shown in Table 7. There is a penalty for eachunmet customer unit of demand: With customer 1, a penaltycost of $90 is incurred; with customer 2, $80; and withcustomer 3, $110. Formulate a balanced transportationproblem to minimize the sum of shortage and shipping costs.arrow_forwardA company manufactures two types of trucks. Eachtruck must go through the painting shop and the assembly shop. If the painting shop were com-pletely devoted to painting type 1 trucks, 650 per day could be painted, whereas if the painting shopwere completely devoted to painting type 2 trucks,550 per day could be painted. If the assembly shopwere completely devoted to assembling truck 1engines, 1400 per day could be assembled, whereasif the assembly shop were completely devoted toassembling truck 2 engines, 1000 per day could beassembled. It is possible, however, to paint bothtypes of trucks in the painting shop. Similarly, it ispossible to assemble both types in the assemblyshop. Each type 1 truck contributes $2500 to profit; each type 2 truck contributes $3000. Use Solver to maximize the company’s profit. (Hint: One ap-proach, but not the only approach, is to try a graphi-cal procedure first and then deduce the constraints from the graph.)arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
Practical Management ScienceOperations ManagementISBN:9781337406659Author:WINSTON, Wayne L.Publisher:Cengage,
Practical Management Science
Operations Management
ISBN:9781337406659
Author:WINSTON, Wayne L.
Publisher:Cengage,