Each day, a company makes deliveries to four restaurants. The service uses one truckthat starts at its warehouse, makes a delivery to each restaurant in turn, and thenreturns to the warehouse. The distance (km) between each location is shown in thefollowing table:LocationLocation12345110152040210121624315121020420161016540242016The warehouse is Location 1 and the restaurants are Locations 2-5.The goal is to determine the route the truck should take to start at the warehouse, visiteach restaurant once, and return to the warehouse while minimising the total distancetraveled.a. Formulate this as an integer programming problem. In your answer you mustintroduce any variables needed to describe the quantities in the problem,and briefly explain what they mean.state the objective function.write down all constraints that apply, and briefly explain what they mean.b. Solve the problem to find the route and and the minimum distance. You may use alinear programming tool or a manual method to solve this problem. All working orcomputer input and output must be shown, and you must include a briefconcluding sentence describing your findings.

Find the Given details below: Given details: Location Location 1 2 3 4 5 1 - 10 15 20 40…

Answered: Each day, a company makes deliveries to…

Practical Management Science

6th Edition

ISBN:9781337406659

Author:WINSTON, Wayne L.

Publisher:WINSTON, Wayne L.

Chapter2: Introduction To Spreadsheet Modeling

Section: Chapter Questions

Problem 20P: Julie James is opening a lemonade stand. She believes the fixed cost per week of running the stand...

See similar textbooks

Similar questions

2. Metropolitan Manila has four incinerator sites for processing solid waste. There are five garbage collection areas within the metropolis. The city wants to determine the least-cost method of disposing of its trash. Each incinerator is characterized by an operating cost for processing each ton of waste and also a cost for transporting each ton of waste is summarized in the table below: Collection Incinerator Site Area 1 2 3 4 50 120 110 60 B 100 55 90 70 60 40 80 65 90 75 85 110 80 100 95 65 Incinerator sites 1 and 2 have a weekly capacity of 6,000 tons each, site 3 has a capacity of 8,000 tons and site 4 has a capacity of 10,000 tons. There are 4,000 tons of waste generated at area A, 8,000 tons at area B and 5,000 tons each at areas C and D, each week. A total of 25,000 tons of waste each week are generated from all five areas.
A 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…
Here is the initial tableau (by the NorthWest method) of a Min transportation problem. 1 2 3 Demand 19 Dual(v) 1 15 9 S1: 11 10 14 0 S2: 0 S3: B 0 B 3 N 15 Demanders 2 8 0 9 12 188 15 9 21 5 N 0 B 0 B 13 10 8 8 20 3 0 20 -4 N -6 N 0 B 17 7 5 4 0 0 1 -14 N -8 N 0 B Supply Dual(u) 0 (188 188 188 188 Using the Loop method fill in the values of the next tableau Each 2x2 matrix is the relevant square in the tableau. 9 (For grading convenience, in bottom right corner of each box use 1 for "B" and 0 for "N") 22 188 188 188 30 -4 2
Macon Controls produces three different types of control units used to protect industrial equipment from overheating. Each of these units must be processed by a machine that Macon considers to be their process bottleneck. The plant operates on two 8-hour shifts, 5 days per week, 52 weeks per year. The table below provides the time standards at the bottleneck, lot sizes, and demand forecasts for the three units. Because of demand uncertainties, the operations manager obtained three demand forecasts (pessimistic, expected, and optimistic). The manager believes that a 25 percent capacity cushion is best. i Demand Forecast Component A B C Time Standard Processing (hr/unit) 0.04 0.20 0.05 Setup (hr/lot) 1.0 4.4 8.5 Lot Size (units/lot) 50 75 100 Demand Forecast Pessimistic Expected 16,000 17,000 10,000 12,000 18,000 24,000 a. How many machines are required to meet minimum (Pessimistic) demand, expected demand, and maximum (Optimistic) demand? (Enter your responses rounded up to the next…
J 2 An electronics store wants to identify a location for a warehouse that will ship to five retail stores. The coordinates and annual number of truckloads are given in the accompanying table. Develop a model to find the best location, assuming that straight-line distances can be used between the locations. Experiment with the model by testing each of the possible best solutions, included, to find the best location. Click here to view the data for the store locations and annual numbers of truckloads. Click here to view some possible best solutions. The best location is at____. (Type an ordered pair. Round each coordinate to the nearest integer as needed.)
A company manufactures a product at its plants in C and D; then ships the product to its four distribution centers in K, L, M, and N. The transportation costs per unit (in dollars per unit) are as follows: from C to K, L, M, and N: 10, 5, 9, and 20. from D to K, L, M, and N: 2, 8, 30, and 10. The monthly demand from K, L., M, and N are: 3000, 1400, 4000, and 1200 units, respectively. On the other hand, the monthly capacity at plants C and D are: 4100 and 5800 units, respectively. Develop a linear programming model that can be used to determine the distribution plan that will minimize total monthly transportation cost. Use Excel Solver to find the optimal solution The optimal solution shows that the total monthly transportation cost is dollars.
The Rae Mischel Company expanded its shipping capacity and the additional cost of doing this from each warehouse to terminal is highlighted in the following table. Determine theminimum cost to ship from each warehouse to terminal.
A company has three existing warehouses to which it will ship furniture from a new factory whose location must be decided. The factory will receive raw materials from its wood supplier and fabric supplier. The annual number of shipments, shipment costs and the location of the suppliers and warehouses are shown below Existing facilities Annual L to or from fact cost Coordinate location Wood supplier 120 10 (100, 400) Fabric supplier 200 10 (800,700) Ware h 1 61 10 (300, 600) Ware h 2 40 10 (200, 100) Ware h 3 70 10 (600, 200) Using the median load answer the following questions –Where the factory should be located to minimize annual transportation cost –What will be the minimum annual transportation cost
Your fast-food outlet, Burger Queen, has obtained a license to open branches in three closely situated South African cities: Brakpan, Nigel, and Springs. Your market surveys show that Brakpan and Nigel each provide a potential market of 2,500 burgers a day, while Springs provides a potential market of 1,000 burgers per day. Your company can only finance an outlet in one of those cities at the present time. Your main competitor, Burger Princess, has also obtained licenses for these cities, and is similarly planning to open only one outlet. If you both happen to locate at the same city, you will share the total business from all three cities equally, but if you locate in different cities, you will each get all the business in the cities in which you have located, plus half the business in the third city. The payoff is the number of burgers you will sell per day minus the number of burgers your competitor will sell per day. Set up the payoff matrix. O a. Your Competitor B N S Вг 1,5001…
A bank has its head office in the financial district in the middle ofa city. A bank has six branches, three in the north of the city and threein the south all 5 km from the centre and spaced 3 km apart. The bankwishes to link all its branches via private leased lines but mustdecide between providing an individual line to each branch via anumber of inter-branch links and a smaller number of multiplexed linesto the centre. If a modem costs £100, a multiplexer/demultiplexercosts £200 and leased lines cost £100 per km per year to rent, suggesta design that will yield the most cost effective solution if theinstallation is to remain in operation for four years. 1st option is - link all branches by providing individual line to each branch via a number of inter branch links to the centre. 2nd option is - link all branches by providing smaller number of multiplexed lines to the centre Please calculate both options and choose the most cost effective solution for four years?
Jason Company manufactures plastic products at three locations in Malaysia: Skudai, Taiping, and Ujok. The company needs to supply the products to three clients in Penang, Kuantan, and Melaka. The production capacities of the plants are given below. Find the optimal solution using stepping stone method. Client Plant (То) Supply (From) Penang Kuantan Melaka RM50 RM40 RM60 Skudai 4000 RM30 RM45 RM40 Taiping 3000 RM60 RM35 RM30 Ujok 3000 Demand 2000 4500 3500 10000
Which of the following functions is done by Transport Management System (TMS): Select one: a. Inventory tracking b. Labour management c. Freight management d. Shipping and receiving

Recommended textbooks for you

Practical Management Science

Operations Management

ISBN:

9781337406659

Author:

WINSTON, Wayne L.

Publisher:

Cengage,

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

Practical Management Science

Operations Management

ISBN:

9781337406659

Author:

WINSTON, Wayne L.

Publisher:

Cengage,

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

Business in Action

Operations Management

ISBN:

9780135198100

Author:

BOVEE

Publisher:

PEARSON CO

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.

SEE MORE TEXTBOOKS