Practical Management Science
6th Edition
ISBN: 9781337406659
Author: WINSTON, Wayne L.
Publisher: Cengage,
expand_more
expand_more
format_list_bulleted
Concept explainers
Question
Chapter 7.5, Problem 26P
Summary Introduction
To use: The solver table to identify the impact of moving one customer away from another on the optimal solution.
Non-linear programming (NLP):
Non-linear programming (NLP) is used in complex optimization problems where the objectives or constraints or sometimes both are non-linear functions of the decision variables. A model can be termed as non-linear for more than one reason.
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
The distance between two cities in the United States can be approximated by the following formula, where lat1 and long1 are the latitude and longitude of city 1 and lat2 and long2 are the latitude and longitude of city 2.
69
(lat1 − lat2)2 + (long1 − long2)2
Ted's daughter is getting married, and he is inviting relatives from 15 different locations in the United States. The file Wedding gives the longitude, latitude, and number of relatives in each of the 15 locations.
Ted would like to find a wedding location that minimizes the demand-weighted distance, where demand is the number of relatives at each location. Assuming that the wedding can occur anywhere, find the latitude and longitude of the optimal location. (Hint: Notice that all longitude values given for this problem are negative. Make sure that you do not check the option for Make Unconstrained Variables Non-Negative in Solver. Round your answers to three decimal places.)
latitude of the optimal wedding location:…
A coordinate system is superimposed on a map. Three existing facilities arelocated at (5, 15), (10, 20), and (6, 9). Compute both the rectilinear and theEuclidean distances separating each facility from a new facility located at (x, y) =(8, 8).
The High-Price Oil Company owns a pipeline network that is used to convey oil from its source to several storage locations. A portion of the network is as follows:
Due to the varying pipe sizes, the flow capacities vary. By selectively opening and closing sections of the pipeline network, the firm can supply any of the storage locations.
a. If the firm wants to fully utilize the system capacity to supply storage location 7, how long will it take to satisfy a location 7 demand of 100,000 gallons? What is the maximal flow for this pipeline system?
b. If a break occurs on line 2–3 and that line is closed down, what is the maximal flow for the system? How long will it take to transmit 100,000 gallons to location 7?
Chapter 7 Solutions
Practical Management Science
Ch. 7.3 - Prob. 1PCh. 7.3 - Prob. 2PCh. 7.3 - Pricing Decisions at Madison The Madison Company...Ch. 7.3 - Prob. 4PCh. 7.3 - Prob. 5PCh. 7.3 - Prob. 6PCh. 7.3 - Prob. 7PCh. 7.3 - Prob. 8PCh. 7.3 - Prob. 9PCh. 7.3 - Prob. 10P
Ch. 7.3 - Prob. 11PCh. 7.3 - Prob. 12PCh. 7.3 - Prob. 13PCh. 7.3 - PRICING SUITS AT SULLIVANS Sullivans is a retailer...Ch. 7.3 - Prob. 15PCh. 7.4 - Prob. 16PCh. 7.4 - Prob. 17PCh. 7.4 - Prob. 18PCh. 7.4 - Prob. 19PCh. 7.4 - Prob. 20PCh. 7.4 - Prob. 21PCh. 7.4 - Prob. 22PCh. 7.4 - Prob. 23PCh. 7.5 - Prob. 24PCh. 7.5 - Prob. 25PCh. 7.5 - Prob. 26PCh. 7.5 - Prob. 27PCh. 7.6 - Prob. 28PCh. 7.6 - Prob. 29PCh. 7.6 - Prob. 30PCh. 7.6 - Prob. 31PCh. 7.6 - Prob. 32PCh. 7.6 - Prob. 33PCh. 7.6 - The method for rating teams in Example 7.8 is...Ch. 7.7 - Prob. 35PCh. 7.7 - Prob. 36PCh. 7.7 - Prob. 37PCh. 7.7 - The stocks in Example 7.9 are all positively...Ch. 7.7 - Prob. 39PCh. 7.7 - Prob. 40PCh. 7.7 - Prob. 41PCh. 7.7 - Prob. 42PCh. 7.8 - Given the data in the file Stock Beta.xlsx,...Ch. 7.8 - Prob. 44PCh. 7 - Prob. 45PCh. 7 - Prob. 46PCh. 7 - Another way to derive a demand function is to...Ch. 7 - Prob. 48PCh. 7 - If a monopolist produces q units, she can charge...Ch. 7 - Prob. 50PCh. 7 - Prob. 51PCh. 7 - Prob. 52PCh. 7 - Prob. 53PCh. 7 - Prob. 54PCh. 7 - Prob. 55PCh. 7 - Prob. 56PCh. 7 - A beer company has divided Bloomington into two...Ch. 7 - Prob. 58PCh. 7 - Prob. 59PCh. 7 - Prob. 60PCh. 7 - Prob. 61PCh. 7 - Prob. 62PCh. 7 - Prob. 63PCh. 7 - You have 50,000 to invest in three stocks. Let Ri...Ch. 7 - Prob. 65PCh. 7 - Prob. 66PCh. 7 - Prob. 67PCh. 7 - Prob. 68PCh. 7 - Prob. 69PCh. 7 - Prob. 70PCh. 7 - Based on Grossman and Hart (1983). A salesperson...Ch. 7 - Prob. 73PCh. 7 - Prob. 74PCh. 7 - Prob. 75PCh. 7 - Prob. 76PCh. 7 - Prob. 77PCh. 7 - Prob. 78PCh. 7 - Prob. 79PCh. 7 - Prob. 80PCh. 7 - Prob. 81PCh. 7 - Prob. 82PCh. 7 - Prob. 83PCh. 7 - Prob. 84PCh. 7 - Prob. 85PCh. 7 - Prob. 86PCh. 7 - Prob. 1.1CCh. 7 - Prob. 1.2CCh. 7 - Prob. 1.3CCh. 7 - Prob. 1.4C
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
- The Sunshine Rental Car Agency has six lots in Orlando,and it wants to have a certain number of cars available ateach lot at the beginning of each day for local rental. Theagency would like a model it could quickly solve atthe end of each day that would tell how to redistribute thecars among the six lots at the minimum total mileage.The distances between the six lots are as follows:arrow_forwardIn the transportation model, you determine the lowest number first in the row then in the column & then subtract it to the numbers they are aligned in respectively. *FalseTrueThe transportation model is designed to maximize the total cost of delivering products from a source to a destination. *FalseTrueA goal programming problem had two equally important goals. Goal number 1: to achieve exactly $1,500 profit; Goal number 2: to avoid overtime. The objective function for this goal programming problem is written as: Minimize G = 2(d1-) + (d1+) + (d2+) *FalseTrueSetup cost (dollars per inventory unit per unit time) includes: capital invested in inventory, storage and handling of material, & insurance. *TrueFalsePlacing a new order whenever the inventory level drops to a specific re-order point is known as periodic order. *FalseTruearrow_forwardFind the optimal solution for the following problem. (Round your answers to 3 decimal places.) Maximize C = 13x + 3y subject to 12x + 14y ≤ 21 15x + 20y ≤ 37 and x ≥ 0, y ≥ 0. What is the optimal value of x?arrow_forward
- A company has 30,000 employees in three cities as shown in the table below. It wishes to give promotions to 200 employees. Cities A B C Total Original Number of Employees 9140 6070 14,790 30,000 a) Apportion the promotions using Hamilton's method. b) Suppose that in 10 years the cities have the following number of employees and the company wishes to again give promotions to 200 employees. Does the population paradox occur using Hamilton's method? Cities A B C Total Number of Employees 10 years later 9190 6070 14,890 30,150 a) Complete the table with Hamilton's apportionment for the original number of employees. Cities A B C Total Original Number of Employees 9140 6070 14,790 30,000 Hamilton's Apportionment ? ? ? 200arrow_forwardThe logistic company headquartered in New York wants to expand its business in Chicago, Texas, and Las Vegas. They will place 3 branch heads (A, B a, nd C) from several branch offices owned by the company to set-up offices and run operations in these 3 locations. Below are the costs for allocating the 3 branch heads to each location: Chicago Texas Las Vegas A $8,000,000 $11,000,000 $12,000,000 B $5,000,000 $15,000,000 $13,000,000 C $5,000,000 $10,000,000 $23,000,000 a. Create a table using the assignment method.b. Based on the results of your calculations, what advice can you give to the leader of the company for the most optimum companylocation placement of each of the above branch heads? Explain why?c. What is the total optimum cost that must be incurred by the company to allocate all company branch offices?arrow_forwardFind the optimal solution for the following problem. (Round your answers to 3 decimal places.) Minimize C = 11x + 5y + 10z subject to 8x + 12y + 19z ≥ 68 13x + 16y + 5z ≥ 136 and x ≥ 0, y ≥ 0, z ≥ 0. What is the optimal value of x? What is the optimal value of y? What is the optimal value of z? What is the minimum value of the objective function?arrow_forward
- Given the following existing facilities data: Existing facility #1 has weight 2 and coordinate (9, 10). Existing facility #2 has weight 10 and coordinate (6, 8). Existing facility #3 has weight 8 and coordinate (-3, -3). Existing facility #4 has weight 9 and coordinate (5, 2). Existing facility #5 has weight 3 and coordinate (-7, -1). Existing facility #6 has weight 7 and coordinate (-2, -6). Existing facility #7 has weight 4 and coordinate (-5, 0). Existing facility #8 has weight 3 and coordinate (4, -7). What is the optimal minisum rectilinear x-coordinate? What is the optimal minisum rectilinear y-coordinate? What is the optimal minisum rectilinear objective function value? Need allarrow_forwardA health Centre will be built to serve 7 communities. The geographical location of the communities and their population is shown in the table below. Communities A, X =2.5 (km), Y=4.5(km), Population( 000's)=2 Communities B, X =2.5 (km), Y=2.5(km), Population( 000's)=5 Communities C, X =5.5 (km), Y=4.5(km), Population( 000's)=10 Communities D, X =5 (km), Y=2(km), Population( 000's)=7 Communities E, X =8 (km), Y=5(km), Population( 000's)=10 Communities F, X =7 (km), Y=2(km), Population( 000's)=20 Communities G, X =9 (km), Y=2.5(km), Population( 000's)=14 There is a possibility of building the Centre in two communities, community C and F. Based on the Demand-Distance criterion what is your recommendation for the site of the Centre. The distances to be measured based on Rectilinear method. Based on…arrow_forwardConsider the following linear programming problem: Min Z = 50x1 + 60x2 s.t. 6x1 + 5x2 >= 30 8x1+4x2 >= 32 x1,x2 >=0. What is the Z in the optimal point of this problem? a. 200 b. 250 c. 300 d. 350 e. none of the abovarrow_forward
- Find the optimal solution for the following problem. (Round your answers to 3 decimal places.) Maximize C = 14x + 13y + 5z subject to 9x + 11y + 18z ≤ 61 14x + 15y + 12z ≤ 122 and x ≥ 0, y ≥ 0, z ≥ 0. What is the optimal value of x? What is the optimal value of y? What is the optimal value of z? What is the maximum value of the objective function?arrow_forward1. True/FalseA company wants to hire 4 vendors for the sale of 4 products, they could only sell one type of product. The following table (image) indicates what each seller charges for selling each of the products. The company wants to assign each seller a product, find all possible optimal assignments by pinpointing their optimal cost. answer the following:a) It is an allocation model T() F()b) It is not a transportation model T() F()c) The model is not balanced T() F()d) The problem has exactly 24 feasible points T() F()arrow_forwardIn a 3 x 3 transportation problem, let xij be the amount shipped from source i to destination j and let cij be the corresponding transportation cost per unit. The amounts of supply at sources 1, 2, and 3 are 15, 30, and 85 units, respectively, and the demands at destinations 1, 2, and 3 are 20, 30, and 80 units, respectively. Assume that the starting northwest-corner solution is optimal and that the associated values of the multipliers are given us u1 = -2, u2 = 3, u3 = 5, v1 = 2, v2 = 5, and v3 = 10. a) Find the associated optimal cost. b) Determine the smallest value of cij for each nonbasic variable that will maintain the optimality of the northwest-corner solution.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,