OPERATIONS MANAGEMENTW/OML LAB >C<
17th Edition
ISBN: 9781323432464
Author: HEIZER
Publisher: PEARSON C
expand_more
expand_more
format_list_bulleted
Concept explainers
Question
Chapter B, Problem 34P
a)
Summary Introduction
To define: The objective function and constraints using linear programming.
Introduction:
Linear programming:
It is a linear optimization technique followed to develop the best outcome for the linear programming problem. The outcome might be to maximize profit, minimize cost, or to determine the optimal product mix. The outcome will take the constraints present in achieving the solution into consideration.
b)
Summary Introduction
To determine: The optimal solution.
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solutionStudents have asked these similar questions
PLEASE SHOW ALL FORMULA
PharmaCo wants to determine how to deploy sales representatives across its Western U.S. region to support a new drug for obesity. Sales representatives will be located in a "home city", which they serve, in addition to cities with feasible commuting distance, with the objective that all cities must be served by at least one sales representative. The feasible connections between each city in the region are listed below (1 indicates a feasible connection, potential home cities are shown in columns, and cities served in rows):
Potential Rep Home
City Served?
Albuquerque
El Paso
Denver
Phoenix
San Diego
Los Angeles
San Francisco
Portland
Seattle
Las Vegas
Salt Lake City
Albuquerque
1
1
1
1
0
0
0
0
0
0
0
El Paso
1
1
0
1
0
0
0
0
0
0
0
Denver
1
0
1
1
0
0
0
0
0
0
1
Phoenix
1
1
1
1
1
1
0
0
0
1
1
San Diego
0
0
0
1
1
1…
Baseball umpiring crews are currently in four cities where three-game series are beginning. When these are finished, the crews are needed to work games in four different cities. The distances (miles) from each of the cities where the crews are currently working to the cities where the new games will begin are shown in the following table. The X indicates that the crew in Oakland cannot be sent to Toronto.
Formulate as a linear programming problem to minimize the miles traveled. HINT: Since one assignment cannot be made, what are the options for that variable in the formulation?
Solve using Excel solver.
Note:-
Do not provide handwritten solution. Maintain accuracy and quality in your answer. Take care of plagiarism.
Answer completely.
You will get up vote for sure.
Transportation Problems: The EBKK company has three plants producing child push chairs that are to be shipped to four distribution centers. Plans 1, 2, and 3 produce 12, 17, and 11 shipments per month, respectively. Each distribution center needs to receive 10 shipments per month. The distance from each plant to the respective distribution center is given below:
DISTRIBUTION CENTER
Plant
1
2
3
4
1
800
1300
400
700
2
1100
1400
600
800
3
600
1200
800
900
a. Draw a complete network representation of the problem
b. Is the initial solution optimal?
c. Find the optimal solution using the MODI Method
d. The freight cost for each shipment is $100 plus 50 cents per mile. How much should be shipped from each plant to each of the distribution centers to minimize the total shipping cost?
Chapter B Solutions
OPERATIONS MANAGEMENTW/OML LAB >C<
Ch. B - Prob. 1DQCh. B - Prob. 2DQCh. B - Prob. 3DQCh. B - Prob. 4DQCh. B - Prob. 5DQCh. B - Prob. 6DQCh. B - Prob. 7DQCh. B - Prob. 8DQCh. B - Prob. 9DQCh. B - Prob. 10DQ
Ch. B - Prob. 11DQCh. B - Where a constraint crosses the vertical or...Ch. B - Prob. 13DQCh. B - The LP relationships that follow were formulated...Ch. B - Prob. 2PCh. B - Prob. 3PCh. B - B.4. Consider the following linear programming...Ch. B - Prob. 5PCh. B - Prob. 6PCh. B - Green Vehicle Inc. manufactures electric cars and...Ch. B - Prob. 8PCh. B - Prob. 9PCh. B - Prob. 10PCh. B - Prob. 11PCh. B - Prob. 12PCh. B - Prob. 13PCh. B - Prob. 14PCh. B - Prob. 22PCh. B - A fertilizer manufacturer has to fulfill supply...Ch. B - Prob. 25PCh. B - Prob. 26PCh. B - Prob. 27PCh. B - Prob. 28PCh. B - Prob. 29PCh. B - Prob. 30PCh. B - How many corner points are there in the feasible...Ch. B - Prob. 34PCh. B - Prob. 35PCh. B - Prob. 36PCh. B - Prob. 37PCh. B - Prob. 38PCh. B - Bowman Builders manufactures steel storage sheds...Ch. B - Prob. 40PCh. B - Prob. 41PCh. B - Quain Lawn and Garden, Inc Bill and Jeanne Quain...Ch. B - Quain Lawn and Garden, Inc Bill and Jeanne Quain...Ch. B - Prob. 1.1VCCh. B - Prob. 1.2VCCh. B - Prob. 1.3VCCh. B - Prob. 1.4VC
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
- Oranges are grown, picked and then stored in warehouses in Tampa, Miami, and Fresno. Theses warehouses supply oranges to markets in New York, Philadelphia, Chicago, and Boston. The following table shows the shipping costs per truckload (in hundreds of dollars), supply, and demand. Because of an agreement between distributors, shipments are prohibited from Miami to Chicago Formulate this problem as a Linear Programming Define decision variables. Define objective function. Define the constraints.arrow_forwardSuisan Fish Company contracts with fishers in Hilo, Kona, and Puna, Big Island to purchase fishes. The fishes are cleaned and stored at the local processing facilities. Then the fishes are shipped to two plants, where they are cut, processed, and packaged as sushi and sashimi. The sushi and sashimi are then transported to three restaurants. The transportation costs per fish from the fishers to the plants and from the plants to the restaurants are summarized in the following tables: Determine the optimal shipments from fishers to plants and from plants to restaurants to minimize total transportation costs. Include the formulation and solver outputs. What would be the effect on the solutions if the capacity at each plant were 70 fishes?arrow_forwardAt the end of a cycle of schedules, a trucking firm has a surplus of one vehicle each in cities A, B, C, D, E, and F and a deficit of one vehicle each in cities 1, 2, 3, 4, 5, and 6. The distances between cities with a surplus and the cities with a deficit are shown below. Find an assignment of surplus vehicles to deficit cities that will result in a minimum total distance. What is the total distance? -Solve the following transportation models using Excel Solver. -Find the optimal solution for the transportation problem having the cost and requirement tablebelow.arrow_forward
- The Hamilton County Local Government has eight sectors which need fire protection. Adequate Fire protection can be provided in each sector either by building a fire station in that sector, or by building a fire station in another sector which is no more than a 12-minute drive away. The time to drive between the centers of each pair of sectors is given in the following table. (Because of one-way streets and left turns the times are not symmetric.) The cost to build a fire station is the same in each sector. Formulate an integer programming model to choose which sectors should have their own fire station. Solve the model by using Excel Solver.arrow_forwardFour cargo ships must be used to transport goods from one port to four other ports (numbered 1, 2, 3, and 4). Any boat can be used to make any of the four trips. However, given some differences between ships and cargoes, the total cost of loading, transporting, and unloading goods from different combinations of ships and ports varies considerably. These costs are shown in the following table: The goal is to assign ships to ports in a one-to-one correspondence so that the total cost of the four shipments is minimized. a) Describe how this problem can be adapted to the general format of assignment problems. b) Obtain an optimal solution using Excel Solver step by steparrow_forwardTMA manufactures 37-in. high definition LCD televisions in two separate locations, Locations I and II. The output at Location I is at most 6000 televisions/month, whereas the output at Location II is at most 5000 televisions/month. TMA is the main supplier of televisions to the Pulsar Corporation, its holding company, which has priority in having all its requirements met. In a certain month, Pulsar placed orders for 3000 and 4000 televisions to be shipped to two of its factories located in City A and City B, respectively. The shipping costs (in dollars) per television from the two TMA plants to the two Pulsar factories are as follows. To Pulsar Factories From TMA City A City B Location I $5 $3 Location II $6 $9 TMA will ship x televisions from Location I to city A and y televisions from Location I to city B. Find a shipping schedule that meets the requirements of both companies while keeping costs to a minimum. (x, y) =…arrow_forward
- A city has two high schools. The first school has a maximum enrollment of 900 students and the second school has a maximum enrollment of 550 students. The city is divided into two regions: Inner City and Suburbs. There are at least 500 students in the Inner City region and at least 800 students in the Suburbs region. The annual transportation cost varies by region as shown in the table.arrow_forwardGeneral Ford has two plants, two warehouses, and three customers. The locations of these as follows: Plants: Detroit and Atlanta;Warehouses: Denver and New YorkCustomers: Los Angeles, Chicago, and Philadelphia Cars are produced at plants, then shipped to warehouses, and finally shipped to customers. Detroit can produce 142 cars per week, and Atlanta can produce 86 cars per week. Los Angeles requires 50 cars per week; Chicago, 52; and Philadelphia 84. It costs $9500 to produce a car in Detroit and $7500 to produce a car in Atlanta, and the costs of shipping a car between cities are given in the table below. What is the minimal cost of meeting General Ford's weekly demands?arrow_forwardA beer distributor needs to plan how to make deliveries from its warehouse (node 1) to a supermarket (node 7), as shown in the network below. A graph with 7 nodes and 9 arcs is shown. Node 1 is connected to node 2 by arc of value 3, to node 5 by arc of value 3, and to node 6 by arc of value 11. Node 2 is connected to node 3 by arc of value 4. Node 3 is connected to node 2 by arc of value 4 and to node 4 by arc of value 7. Node 4 is connected to node 3 by arc of value 7, to node 6 by arc of value 5, and to node 7 by arc of value 6. Node 5 is connected to node 6 by arc of value 7. Node 6 is connected to node 4 by arc of value 5, to node 5 by arc of value 7, and to node 7 by arc of value 3. Develop the LP formulation for finding the shortest route from the warehouse to the supermarket. (Let xij represent the flow from node i to node j.) Min s.t.Node 1 Flows Node 2 Flows Node 3 Flows Node 4 Flows Node 5 Flows Node 6 Flows Node 7…arrow_forward
- Paul Bergey is in charge of loading cargo ships for International Cargo Company (ICC) at the port in Newport News, Virginia. Paul is preparing a loading plan for an ICC freighter destined for Ghana. An agricultural commodities dealer wants to transport the following products aboard this ship. Commodity A B C D Amount Available (tons)4,8002,5001,2001,700 Volume per Ton (cubic feet) 40256055 Profit per Ton ($)70506080 Paul can elect to load any and/or all of the available commodities. However, the ship has three cargo holds with the following capacity restrictions. Cargo Hold Forward Center Read Weight Capacity (tons) 3,000 6,000 4,000 Volume Capacity (cubic feet) 145,000 180,000 155,000 More than one type of commodity can be placed in the same cargo hold. However, because of balance considerations, the weight in the forward cargo hold must be within 10% of the weight in the rear cargo hold, and the center cargo hold must be between 40% and 60% of the total…arrow_forwardThe 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:…arrow_forwardThe Sav-Us Rental Car Agency has six lots in Nashville, and it wants to have a certain number of cars available at each lot at the beginning of each day for local rental. The agency would like a model it could quickly solve at the end of each day that would tell it how to redistribute the cars among the six lots in the minimum total time. The times required to travel between the six lots are as follows: To (min.) From 1 2 3 4 5 6 1 12 17 18 10 20 2 14 10 19 16 15 3 14 10 12 8 9 4 8 16 14 12 15 5 11 21 16 18 10 6 24 12 9 17 15 The agency would like the following number of cars at each lot at the end of the day. Also, shown is the number of available cars at each lot at the end of a particular day. Determine the optimal reallocation of rental cars. Lot (cars) Cars 1 2 3 4 5 6 Available 37 20 14 26 40 28…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,