Consider the following transshipment network for finding the shortest route from node 1 to node 7.Mins.t.Node 1 Flows X12 +*13Node 3 FlowsNode 4 FlowsNode 5 Flows18Node 6 FlowsNode 7 Flowsw+x14XNode 2 Flows -x12 - x32-x52 + x23+x25 = 034(a) Formulate a linear programming model of the problem. (Express your answers using Xij, where each x¡¡ is either 0 or 1 for the arc from node i to node j.)5436367

In the network model, the total flow of input and total flow of output must be the same. Consider…

Answered: Consider the following transshipment…

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

Solve the linear programming problem by the method of corners. Мaximize P %3D х + 5у х + у < 4 2х + у S 5 x 2 0, y 2 0 subject to The maximum is P = at (x, y) =
Davis Inc. produces three product lines in its manufacturing facility in St. John's, NL: Product Line (1), Product Line (2), Product Line (3). Davis is considering dropping Product Line (2) because it has been unprofitable for the past two years. Which of the following items is (are) irrelevant to Davis' decision to drop/keep Product Line (2)? O a) Total cost of rent on the manufacturing facility. O b) Customer demand for Product Line (2). Oc) Savings in direct materials cost associated with Product Line (2). O d) All of the above items are considered relevant in the decision.
4. Consider the following to illustrate a transshipment (Min) problem. Supply (1,000 tons) Fr\To F G H Fr\To D E D $23 $15 $29 A $15 $20 75 E $20 $17 $24 B $18 $16 108 Demand 93 83 123 C $22 $24 86 (1,000 tons) B. Identify a starting solution using Northwest Corner Method. Show complete solution.
The starting node of the shortest path problem has a supply out flow value of -1 in the LP model. True False (Don't hand writing solution)
1
Continuing the previous problem, suppose again thatall arcs go in both directions, but suppose Maude’sobjective is to find the shortest path from node 1 tonode 7 (not node 10). Modify the spreadsheet modelappropriately and solve.
2
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 Flows Node 2 Flows Node 3 Flows Node 4 Flows Node 5 Flows Node 6 Flows 1 Node 7 Flows 3 Develop 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 +4x47 3 Xij > 0 for all i and j 11 *12+*15 +*16 *12*23 *23 + x34 x47+x46 = 1 6 X *16*56 +46-67 *47 +x67 9 = 0 5 X 4 3 3x67 X
solve for y
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?
The network in the figure, shows the routes for shipping cars from three (3) plants (nodes, 1,2 and 3) to three (3) dealers (nodes, 6, 7, 8) by way of two (2) distribution centers (nodes 4and 5). The shipping costs per car (in $100) are shown on the arcs. Solve the problem as a transshipment model.1. Formulate the Linear Programming model 2. Choose one among the three methods for the starting/initial basic solution 3. Solve for the optimal solution using Method of Multipliers
The manager of a company wishes to assign three jobs to four machines on one-on-one basis. The cost of each job on each machine if given on the following table. Solve it through Branch and Bound on Assignment Problem.

SEE MORE QUESTIONS

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