Practical Management Science
6th Edition
ISBN: 9781337406659
Author: WINSTON, Wayne L.
Publisher: Cengage,
expand_more
expand_more
format_list_bulleted
Concept explainers
Question
Chapter 8.5, Problem 6P
Summary Introduction
To determine: Whether evolutionary solver find the correct solution.
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
Please show tha solutions to the corresponding answer stated in the problem.
Using the Vogel Approximation Method (VAM), determine the optimal allocation of thetruckloads of the Sunray Transport Company between different warehouses and distributioncentres that will minimize the cost and fulfill the demand of all the distribution centres. (Usemanual process)
a mixed integer linear programming question
Chapter 8 Solutions
Practical Management Science
Ch. 8.3 - Prob. 1PCh. 8.3 - Prob. 2PCh. 8.4 - Prob. 3PCh. 8.4 - Prob. 4PCh. 8.4 - Prob. 5PCh. 8.5 - Prob. 6PCh. 8.5 - Prob. 7PCh. 8.5 - In the lawn mower production problem in Example...Ch. 8.6 - Prob. 9PCh. 8.6 - Prob. 10P
Ch. 8.6 - Prob. 11PCh. 8.6 - Prob. 12PCh. 8.7 - Prob. 13PCh. 8.7 - Prob. 14PCh. 8.8 - Prob. 15PCh. 8.8 - Prob. 16PCh. 8.8 - Prob. 17PCh. 8.8 - Prob. 18PCh. 8.8 - Prob. 19PCh. 8 - Prob. 20PCh. 8 - Prob. 21PCh. 8 - Prob. 22PCh. 8 - Prob. 23PCh. 8 - Prob. 24PCh. 8 - Prob. 25PCh. 8 - Prob. 26PCh. 8 - Prob. 27PCh. 8 - Prob. 28PCh. 8 - Prob. 29PCh. 8 - Prob. 30PCh. 8 - Prob. 31PCh. 8 - Prob. 32PCh. 8 - Prob. 33PCh. 8 - Prob. 34PCh. 8 - Prob. 35PCh. 8 - Prob. 36PCh. 8 - Prob. 37PCh. 8 - Prob. 38PCh. 8 - Prob. 39PCh. 8 - Prob. 1CCh. 8 - Prob. 2C
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
- Facility Location. A paper products manufacturer has enough capital to build and manage some additional manufacturing plants in the United States in order to meet increased demand in three cities: New York City, NY; Los Angeles, CA; and Topeka, KS. The company is considering building in Denver, CO; Seattle, WA; and St. Louis, MO. Max Operating Capacity 400 tons/day 700 tons/day Denver Seattle $10/ton $17/tor $5/ton $11/ton.... $18/ton.... $28/ton Los Angeles Topeka New York City Figure 1: Graphical representation of the given data = • The cost fi of building plants in these cities is fi $10,000,000 in Seattle. Unmet Demand 300 tons/day 100 tons/day 500 tons/day • Due to geographic constraints, plants in Denver and Seattle would have a maximum operating capacity kį of 400 tons/day and 700 tons/day respectively. $5,000,000 in Denver and f2 = • The cost cij per ton of transporting paper from city i to city j is outlined in Figure 1. • The unmet demand d, for Los Angeles, Topeka, and New…arrow_forwardFor the remaining questions, consider the following problem description: An oil company is considering exploring new well sites S₁, S2, ..., S10 with respective costs C1, C2, C10. And in particular they want to find the least-cost selection of 5 out of the 10 possible sites. The binary decision variables x₁,x2,..., X10 denote the decision to explore the corresponding site.arrow_forwardNOTE: The answer of this question should be limited to ONE page of writing with reasonable size of fonts. The provincial government plans to distribute certain types of vaccines to the 3 major urban centers of the province covering a large portion of the provincial population. The 5 million doses of vaccines are expected to arrive in large batches at one of the major cargo airports by 2 military transporter airplanes in a single day. The vaccines will then be distributed to the 3 cities with the number of doses corresponding to the population sizes of the 3 cities. They will be further distributed to the 20 hospitals and about 200 local clinics in these 3 cities. Officials of the provincial health agency must plan for the upcoming vaccine distribution. Assume that you are asked to suggest several methods/tools in Industrial Engineering and Operations Research you have learned from this course. Present 3 such methods and for EACH of these methods, briefly explain: 6.1) For solving which…arrow_forward
- 3.4-15* A cargo plane has three compartments for storing cargo: front, center, and back. These compartments have capacity limits on both weight and space, as summarized below: Weight Саpacity (Tons) Space Сapacity (Cubic Feet) Compartment Front 7,000 9,000 5,000 12 Center 18 Back 10 Furthermore, the weight of the cargo in the respective compart- ments must be the same proportion of that compartment's weight capacity to maintain the balance of the airplane.arrow_forwardConsider the Dynamic Program formulation of the n-class optimal booking problem with sequential arrivals. In thisproblem, show some monotonicities of the value function.• Jt(x) − Jt(x − 1) is non-decreasing in t, ∀x.• Jt(x) − Jt(x − 1) is non-increasing in x, ∀t.Consider that the second property implies the first property. To prove the second property, given Dt, consider the discrete concavity of Ht(Dt, x) = max0≤u≤min{Dt,x} (pt)u + Jt−1(x − u) in x, i.e., Ht(Dt, x + 1) − Ht(Dt, x) ≤ Ht(Dt, x) − Ht(Dt, x − 1) for any x ∈ Z+ for any t. Image attatched for clarity.arrow_forwardJohn is travelling from home in Sydney to a hotel in Perth. Three stopovers on the way a number of choices of towns for each stop only one hotel to choose from in each town, except for Perth, where there are three hotels (J, K, and L) to choose from Each trip has a different distance resulting in a different cost (petrol) (cost is marked by each arc) Hotels have different costs (cost is marked by each node (town)) ● ● ● The goal is to select a route to and a hotel in Perth so that the overall cost of the trip is minimized. Use dynamic programming (forward recursion) to solve this problem by constructing the usual tables for each stage. Stage: 0 (Sydney) 1 Petrol cost start 22 8 12 Hotel cost 70 80 B 80 25 10 2 50 A E 70 30 10 18 8 7 3 50 F 70 70 H 60 8 10 10 4 (Perth) 50 13 K 10 15 L 60 70arrow_forward
- HMO has 40 doctors to be apportioned among four clinics. The HMO decides to apportion the doctors based on the average weekly patient load for each clinic, given in the following table. Clinic A B C D Average Weekly 275 392 611 724 Patient Load Find the apportion of A and C using using Adam's Method. Use modified divisor 52. Doctors for clinic A Doctors for clinic B = %3D Doctors for clinic C= Doctors for clinic D =arrow_forwardA linear programming computer package is needed. Kilgore's Deli is a small delicatessen located near a major university. Kilgore does a large walk-in carry-out lunch business. The deli offers two luncheon chili specials, Wimpy and Dial 911. At the beginning of the day, Kilgore needs to decide how much of each special to make (he always sells out of whatever he makes). The profit on one serving of Wimpy is $0.46, on one serving of Dial 911, $0.59. Each serving of Wimpy requires 0.25 pound of beef, 0.25 cup of onions, and 5 ounces of Kilgore's special sauce. Each serving of Dial 911 requires 0.25 pound of beef, 0.4 cup of onions, 2 ounces of Kilgore's special sauce, and 5 ounces of hot sauce. Today, Kilgore has 21 pounds of beef, 16 cups of onions, 89 ounces of Kilgore's special sauce, and 61 ounces of hot sauce on hand. (a) Develop an LP model that will tell Kilgore how many servings of Wimpy and Dial 911 to make in order to maximize his profit today. (Let W = the number of servings of…arrow_forwardA linear programming computer package is needed. Kilgore's Deli is a small delicatessen located near a major university. Kilgore does a large walk-in carry-out lunch business. The deli offers two luncheon chili specials, Wimpy and Dial 911. At the beginning of the day, Kilgore needs to decide how much of each special to make (he always sells out of whatever he makes). The profit on one serving of Wimpy is $0.44, on one serving of Dial 911, $0.57. Each serving of Wimpy requires 0.25 pound of beef, 0.25 cup of onions, and 5 ounces of Kilgore's special sauce. Each serving of Dial 911 requires 0.25 pound of beef, 0.4 cup of onions, 2 ounces of Kilgore's special sauce, and 5 ounces of hot sauce. Today, Kilgore has 21 pounds of beef, 16 cups of onions, 89 ounces of Kilgore's special sauce, and 61 ounces of hot sauce on hand. (a) Develop a linear programming model that will tell Kilgore how many servings of Wimpy and Dial 911 to make in order to maximize his profit today. (Let W = the number…arrow_forward
- A linear programming computer package is needed. Kilgore's Deli is a small delicatessen located near a major university. Kilgore does a large walk-in carry-out lunch business. The deli offers two luncheon chili specials, Wimpy and Dial 911. At the beginning of the day, Kilgore needs to decide how much of each special to make (he always sells out of whatever he makes). The profit on one serving of Wimpy is $0.46, on one serving of Dial 911, $0.59. Each serving of Wimpy requires 0.25 pound of beef, 0.25 cup of onions, and 5 ounces of Kilgore's special sauce. Each serving of Dial 911 requires 0.25 pound of beef, 0.4 cup of onions, 2 ounces of Kilgore's special sauce, and 5 ounces of hot sauce. Today, Kilgore has 18 pounds of beef, 13 cups of onions, 86 ounces of Kilgore's special sauce, and 58 ounces of hot sauce on hand. (a) Develop an LP model that will tell Kilgore how many servings of Wimpy and Dial 911 to make in order to maximize his profit today. (Let W = the number of servings of…arrow_forwardFormulate but do not solve the problem.The management of Hartman Rent-A-Car has allocated $2.25 million to buy a fleet of new automobiles consisting of compact, intermediate-size, and full-size cars. Compacts cost $18,000 each, intermediate-size cars cost $27,000 each, and full-size cars cost $36,000 each. If Hartman purchases twice as many compacts as intermediate-size cars and the total number of cars to be purchased is 100, determine how many cars of each type will be purchased. (Assume that the entire budget will be used. Let x, y, and z denote the number of compact, intermediate-sized, and full-size cars purchased, respectively.) = 2,250,000 = x = 100arrow_forwardfertilizer manufacturer has to fulfill supply contracts to its two main customers (650 tons to Customer A and 800 tons to Customer B). It can meet this demand by shipping existing inventory from any of its three warehouses. Warehouse 1 (W1) has 400 tons of inventory onhand, Warehouse 2 (W2) has 500 tons, and Warehouse 3 (W3) has 600 tons. The company would like to arrange the shipping for the lowest cost possible, where the per-ton transit costs are as follows: W 1 W 2 W 3 Customer A $7.50 $6.25 $6.50 Customer B $6.75 $7.00 $8.00 Write the objective function and the constraint in equations. Let Vij= tons shipped to customer i from warehouse j, and so on. For example, VA1=tons shipped to customer A from warehouse W1. This exercise contains only parts b, c, d, e, and f. Part 2 b) The objective function for the LP model =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,