Operations Management: Sustainability and Supply Chain Management (12th Edition)
12th Edition
ISBN: 9780134130422
Author: Jay Heizer, Barry Render, Chuck Munson
Publisher: PEARSON
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 solution
Students have asked these similar questions
Please help me with part b
eBook
Problem 10-31
A long-distance telephone company uses a fiber-optic network to transmit phone calls and other information between locations. Calls are carried through cable lines and switching nodes. A portion of the company's transmission network is shown here. The numbers above each arc show the capacity in thousands of
messages that can be transmitted over that branch of the network.
To keep up with the volume of information transmitted between origin and destination points, use the network to determine the maximum number of messages that may be sent from a city located at node 1 to a oty located at node 7.
3
Maximum number of messages -
Define Vehicle routing problem (VRP). Explain its complications and variants. Define four different real-life problems that can be formulated as VRP. Explain their properties based on VRP variations.
Chapter B Solutions
Operations Management: Sustainability and Supply Chain Management (12th Edition)
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
- 4.Silicon Valley Transport Commission (SVTC) has a fleet of maintenance vehicles that includes cars, vans, and trucks. SVTC is currently evaluating four different approaches to help them maintain their fleet of cars and vans efficiently at the lowest possible cost. Their options are: (1) No preventive maintenance at all and repair vehicle components when they fail; (2) Take oil samples at regular intervals and perform whatever preventive maintenance is indicated by the oil analysis; (3) Perform an oil change on a regular basis on each vehicle and perform repairs when needed; (4) perform oil changes at regular intervals, take oil samples regularly, and perform maintenance repairs as indicated by the sample analysis. Option #1 costs nothing to implement and results in two possible outcomes: There is a .10 probability that a defective component will occur, requiring emergency maintenance at a cost of $1,200, or there is a chance that no defects will occur and no maintenance will be…arrow_forwardZara is a global clothing company based in Spain and it gives utmost importance to customer value, hence it tries to catch customer satisfaction in transportation. Zara expects the following points to be fulfilled by transport companies: The products must be reached to desired places on time, the products must be shipped without any damage or unwanted condition, the products must be carried to next channel level in a good condition. Additionally, Zara gives less weight to freight costs while determining product prices. Which of the followings is less important in transportation policy of Zara? Select one: a. Condition of goods b. Pricing c. Delivery performance d. Customer satisfactionarrow_forwardSilicon Valley Transport Commission (SVTC) has a fleet of maintenance vehicles that includes cars, vans, and trucks. SVTC is currently evaluating four different approaches to help them maintain their fleet of cars and vans efficiently at the lowest possible cost. Their options are: (1) No preventive maintenance at all and repair vehicle components when they fail; (2) Take oil samples at regular intervals and perform whatever preventive maintenance is indicated by the oil analysis; (3) Perform an oil change on a regular basis on each vehicle and perform repairs when needed; (4) perform oil changes at regular intervals, take oil samples regularly, and perform maintenance repairs as indicated by the sample analysis. Option #1 costs nothing to implement and results in two possible outcomes: There is a .10 probability that a defective component will occur, requiring emergency maintenance at a cost of $1,200, or there is a chance that no defects will occur and no maintenance will be…arrow_forward
- Silicon Valley Transport Commission (SVTC) has a fleet of maintenance vehicles that includes cars, vans, and trucks. SVTC is currently evaluating four different approaches to help them maintain their fleet of cars and vans efficiently at the lowest possible cost. Their options are: (1) No preventive maintenance at all and repair vehicle components when they fail; (2) Take oil samples at regular intervals and perform whatever preventive maintenance is indicated by the oil analysis; (3) Perform an oil change on a regular basis on each vehicle and perform repairs when needed; (4) perform oil changes at regular intervals, take oil samples regularly, and perform maintenance repairs as indicated by the sample analysis. Option #1 costs nothing to implement and results in two possible outcomes: There is a .10 probability that a defective component will occur, requiring emergency maintenance at a cost of $1,200, or there is a chance that no defects will occur and no maintenance will be…arrow_forwardTravelling Salesman Problem (TSP); Given the following distance matrix, use the nearest neighbor (NN) heuristic to find a route that starts from the warehouse (W), visits each customer only once, and finishes at the warehouse to minimize the distance traveled. What is the route and the corresponding distance? Distances W 1 2 3 4 in miles 18 57 27 50 18 0 65 29 61 57 65 0 36 99 3 27 29 36 0 76 4 50 61 99 76 Route=W-1-3-2-4, Distance=182 miles Route=W-3-1-2-4-W, Distance=270 miles Route = W-3-1-2-4, Distance=220 miles Route=W-1-3-2-4-W, Distance=232 miles Route=W-1-3-4-2, Distance=272 miles 1, 2.arrow_forwardCleveland Area Rapid Delivery (CARD) operates a delivery service in the Cleveland metropolitan area. Most of CARD's business involves rapid delivery of documents and parcels between offices during the business day. CARD promotes its ability to make fast and on-time deliveries anywhere in the metropolitan area. When a customer calls with a delivery request, CARD quotes a guaranteed delivery time. The following network shows the street routes available. The numbers above each arc indicate the travel time in minutes between the two locations. Min s.t. Node 1 Flows Node 2 Flows Node 3 Flows Node 4 Flows Node 5 Flows Node 6 Flows 35 For all X;; = 0, 1. (a) Develop a linear programming model that can be used to find the minimum time required to make a delivery from location 1 to location 6. (Express your answers in the form where each Xij represents the arc from node i to node j as either 1 or Xijr 0.) 30 12 p.m. 3 Need Help? Read It 18 15 39 12 16 5 (b) How long (in minutes) does it take to…arrow_forward
- By Monday April 16th the following towns will need the numbers of coal cars listed: coal valley 30 Coaltown 45 Coal Junction 25 Coalsburg 20 Using a railway city to city distance chart, the dispatcher constructs a mileage table on this page. Minimizing total miles over which cars are moved to new locations, compute the best shipment of coal cars.arrow_forwardMorgan Trucking Company operates a special pickup and delivery service between Chicago and six other cities located in a four-state area. When Morgan receives a request for service, it dispatches a truck from Chicago to the city requesting service as soon as possible. With both fast service and minimum travel costs as objectives for Morgan, it is important that the dispatched truck take the shortest route from Chicago to the specified city. Assume that the following network (not drawn to scale) with distances given in miles represents the highway network for this problem. Chicago 1 36 31 21 2 3 9 10 11 21 4 13 Find the shortest-route distance from Chicago to node 6. 6 5 6 16 6 21 7arrow_forwardMount Isa Mines is one of the world’s great metal mines. Its main operations are at Mount Isa, in Queensland, Australia, where it mines adjacent deposits of copper and silver-lead-zinc ores. Production levels changes with world demand and prices, but in atypical year 7 million tonnes of ore are mined to give 150,000 tonnes of copper and lead (containing silver) and 200,000 tonnes of zinc. Mount Isa has serious transport problems. It produces huge quantities of ore in a remote area of Australia, while the main demand for finished metals is in the industrialised areas of the world, particularly Europe. The problem is to process the ores and move them to final markets as cheaply as possible. You can see the scope of the problem from an outline of the journey for copper, this starts with underground explosions to break up the ore body. The broken ore is collected by front-end loaders and put onto ore trains that carry it to underground crushers. The crushed ore is then hoisted to the…arrow_forward
- Mount Isa Mines is one of the world’s great metal mines. Its main operations are at Mount Isa, in Queensland, Australia, where it mines adjacent deposits of copper and silver-lead-zinc ores. Production levels changes with world demand and prices, but in atypical year 7 million tonnes of ore are mined to give 150,000 tonnes of copper and lead (containing silver) and 200,000 tonnes of zinc. Mount Isa has serious transport problems. It produces huge quantities of ore in a remote area of Australia, while the main demand for finished metals is in the industrialised areas of the world, particularly Europe. The problem is to process the ores and move them to final markets as cheaply as possible. You can see the scope of the problem from an outline of the journey for copper, this starts with underground explosions to break up the ore body. The broken ore is collected by front-end loaders and put onto ore trains that carry it to underground crushers. The crushed ore is then hoisted to the…arrow_forwardJohn Clooney, a bush pilot in Alaska, makes regular charter flights in his floatplane to various towns and cities in western Alaska. His passengers include hunters, fishermen, backpackers and campers, and tradespeople hired for jobs in the different localities. He also carries some cargo for delivery. The following network shows the possible air routes between various towns and cities John might take (with the times, in hours). For safety reasons, he flies point-to-point, flying over at least one town along a route, even though he might not land there. In the upcoming week John has scheduled charter flights for Kotzebue, Nome, and Stebbins. Determine the shortest route between John’s home base in Anchorage and each of these destinations.arrow_forwardA supplier ships goods from Richmond, VA to three market places in 3 cities (Chicago, IL; Athens, GA; St. Luis, MO). The supplier can ship every day, every other day, or every third day. There is a penalty of $0.30/cwt for each day delayed. Consolidating shipments allows for lower transportation costs from larger loads, but incurs penalty costs due to the delay. Transportation Rate (S/cwt) Shipment City Weight/day LTL 50,000 lb 50000 lb Chicago, IL 18,000 lb (180 cwt) 1.50 1.25 Athens, GA 15,000 lb (150 cwt) 1.35 1.00 St. Luis, MO 12,000 lb (120 cwt) 2.00 1.50 Total 45,000 Ib = 450 cwt Find what is the cost for the following: Shipping Every Day Shipping on the alternate Day (every two days) Shipping every three Dayarrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
Practical Management ScienceOperations ManagementISBN:9781337406659Author:WINSTON, Wayne L.Publisher:Cengage,
Operations ManagementOperations ManagementISBN:9781259667473Author:William J StevensonPublisher:McGraw-Hill Education
Operations and Supply Chain Management (Mcgraw-hi...Operations ManagementISBN:9781259666100Author:F. Robert Jacobs, Richard B ChasePublisher:McGraw-Hill Education
Purchasing and Supply Chain ManagementOperations ManagementISBN:9781285869681Author:Robert M. Monczka, Robert B. Handfield, Larry C. Giunipero, James L. PattersonPublisher:Cengage Learning
Production and Operations Analysis, Seventh Editi...Operations ManagementISBN:9781478623069Author:Steven Nahmias, Tava Lennon OlsenPublisher:Waveland Press, Inc.
Practical Management Science
Operations Management
ISBN:9781337406659
Author:WINSTON, Wayne L.
Publisher:Cengage,
Operations Management
Operations Management
ISBN:9781259667473
Author:William J Stevenson
Publisher:McGraw-Hill Education
Operations and Supply Chain Management (Mcgraw-hi...
Operations Management
ISBN:9781259666100
Author:F. Robert Jacobs, Richard B Chase
Publisher:McGraw-Hill Education
Purchasing and Supply Chain Management
Operations Management
ISBN:9781285869681
Author:Robert M. Monczka, Robert B. Handfield, Larry C. Giunipero, James L. Patterson
Publisher:Cengage Learning
Production and Operations Analysis, Seventh Editi...
Operations Management
ISBN:9781478623069
Author:Steven Nahmias, Tava Lennon Olsen
Publisher:Waveland Press, Inc.