A 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.s.t.Node 1 FlowsNode 2 FlowsNode 3 FlowsNode 4 FlowsNode 5 FlowsNode 6 Flows1Node 7 Flows3Develop the LP formulation for finding the shortest route from the warehouse to the supermarket. (Let x₁, represent the flow from node i to node j.)+9x56 +Min 3x12 + 3x15 + 11x16 + 6x23 + 5x34 + 3x46 +4x473Xij > 0 for all i and j11*12+*15 +*16*12*23*23 + x34x47+x46= 16X*16*56 +46-67*47 +x679= 05X433x67X

Answered: A beer distributor needs to plan how 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

Please help me solve using solver and show the steps in solver/constraints needed
In this problem, your company is a distributor of products. You serve as an inventorymanager for the regional distribution center (DC) here in the Atlanta area. In this role,you schedule the purchase and shipment of products from various suppliers inbound to theAtlanta DC. Once you receive the products at the DC, they are stored in inventory untilthey are picked, packed, and shipped outbound to your company’s downstream customersin response to orders.For each of your products, you currently use a single, dedicated supplier. Each of yoursuppliers ships their products to you from their facility using trucking services, and theyprovide you with choices of different LTL or truckload trucking carriers depending on yourshipment size.Consider managing inventory now for product 101 produced by Supplier A. Currently,you face demand for product 101 of about 200 units per week. Each unit of product 101has a purchase cost p of $500 and you decide to value your inventory at the slightly higherrate…
Maximal flow problem. Determin the Maximal flow from node 1 to 7
The following network describes a transportation scenario in which there are four sources A, B, C, and D, and three destinations P, Q, and R. (The numbers next to each arrow represent the cost of transporting one unit from that particular source to the destination located at the other end of that arrow). Write the mathematical formulation of the problem. Use the Excel Solver to solve the problem. Generate the answer and sensitivity reports in Excel, and submit your Excel workbook as a separate attachment. Provide the solution obtained in the space provided. What is the optimal cost of transportation?
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.)
9-39. Grey Construction would like to determine the leastexpensive way of connecting houses it is buildingwith cable TV. It has identified 11 possible branchesor routes that could be used to connect the houses.The cost in hundreds of dollars and the branches aresummarized in the following table.(a) What is the least expensive way to run cable tothe houses?
14
The metes and bounds system primarily relies on which of the following to describe land? section, lot, and block numbers within a subdivision a readily identifiable point of beginning and the boundaries of a property in terms of distances and compass directions checks, correction lines, and tiers meridians, base lines, townships, and ranges
John 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 70
3.8. Consider the given network, in which design capacity is represented in the arc. Determine the maximum flow from the source node 1 and to terminal node 5. Find the maximum flow in all arcs. (20,0) (10,0) (30,0) 2 (5, 10) (30,0) (40,0) (20,0) (20,0)

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