Draw the network for this transportation problem. (Let X;; represent the flow from node i to node j.)Xij300 1300 2OMin 2x13 + 4x14 + 4X15 + 10x23 + 11x24 + 11x25s.t.1111104.42X13X14 + X15 ≤ 500X23 + x24 + X25 ≤ 400X13 + x23 = 300X14 +*24 = 300X15 + 25 = 300Xij 203 30044005 500300 1 11300 2300 311104424 400500 15 500 400 22441011113 30043005 300500 1 24002300 341011114 3005 300

The transportation problem is a special type of linear programming problem where the objective is to…

Answered: Draw the network for this…

Practical Management Science

6th Edition

ISBN:9781337406659

Author:WINSTON, Wayne L.

Publisher:WINSTON, Wayne L.

Chapter5: Network Models

Section5.5: Shortest Path Models

Problem 32P

See similar textbooks

Similar questions

example 7b. please show solution
Chapter 5. (M/M/s/K Model). Leia is responsible for 12 computers in the IT offices in a small business called DataWish. Each computer runs on an average for 4 weeks and requires an average of ½ or 0.5 weeks to get reset by Leia before it can start up again. If we assign the Poisson distribution to the “arrival” of each computer for service and an exponential distribution to the actual service provided, answer the following questions: a. The arrival rate would be units per week and the service rate would be units per week. b. Calculate the following operating characteristics for the M/M/s/K system: Utilization Factor (ρ) % Performance Measures P0 (probability that sytem is empty) % L (average units in system) units Lq (average units waiting in queue) units W (average time in the system) weeks Wq (average time in the queue) weeks c. If we assign a cost of waiting as $750 per week per computer and $800 per week of…
Two parts to this question: Node a = new Node(5);Node b = new Node(3, a);Node c = new Node(7, b);Node d = new Node(2, c);Node firstNode = d;Node currentNode = firstNode.next; a. What is the contents of the chain referenced by firstNode? b. What is the data held in the node referred to by currentNode?
two parts to the question Node a = new Node(5);Node b = new Node(3, a);Node c = new Node(7, b);Node d = new Node(2, c);Node firstNode = d;Node currentNode = firstNode; a.What is the contents of the chain referenced by firstNode? b.What is the data held in the node referred to by currentNode?
Jk.335. Propiem 14-8 Rent'R Cars is a multisite car rental company in the city. It is trying out a new "return the car to the location most convenient for you" policy to improve customer service. But this means that the company has to constantly move cars around the city to maintain required levels of vehicle availability. The supply and demand for economy cars, and the total cost of moving these vehicles between sites, are shown below. From To A B C Demand D $9 9 5 50 From/To $8 Candidate solution A B C Total shipped Cost A - B C Total costs 8 3 60 $6 8 3 25 $5 D 0 10 a. Find the solution that minimizes moving costs using Microsoft Excel. (Leave no cells blank - be certain to enter "0" wherever required.) Supply 50 40 75 30 165 165 E F G Supply $
Chapter 5. (M/M/s/K Model). Leia is responsible for 8 computers in the IT offices in a small business called DataWish. Each computer runs on an average for 3 weeks and requires an average of ½ or 0.5 weeks to get reset by Leia before it can start up again. If we assign the Poisson distribution to the "arrival" of each computer for service and an exponential distribution to the actual service provided, answer the following questions: a. The arrival rate would be units per week and the service rate would be units per week. b. Calculate the following operating characteristics for the M/M/s/K system: Utilization Factor (p) % Performance Measures PO (probability that sytem is empty) L (average units in units system) La (average units waiting in queue) units W (average time in the weeks system) Wq (average time in the queue) weeks c. If we assign a cost of waiting as $500 per week per computer and $800 per week of hiring Leia, what is the Total Time Cost per week cost of servicing the…
Chapter 5. (M/M/s/K Model). Leia is responsible for 8 computers in the IT offices in a small business called DataWish. Each computer runs on an average for 3 weeks and requires an average of ½ or 0.5 weeks to get reset by Leia before it can start up again. If we assign the Poisson distribution to the "arrival" of each computer for service and an exponential distribution to the actual service provided, answer the following questions: a. The arrival rate would bel units per week and the service rate would be units per week. b. Calculate the following operating characteristics for the M/M/s/K system: Utilization Factor (p) Performance Measures c. If we assign a cost of waiting as $500 per week per computer and $800 per week of hiring Leia, what is the Total Time Cost per week cost of servicing the machines? PO (probability that sytem is empty) % dollars L (average units in system) units d. If DataWish decides to hire another individual to help Leia, what would the new Total Time Cost per…
Qn1. Find the optimal solution to the transportation problem using MODI method. Warehouses Supply WI W2 W3 W4 P1 19 30 50 12 Plants 5. 2. P2 70 30 40 60 P3 40 10 60 20 3. 15 Demand 4)
Maximize p = 7x + 6y + 3z subject to x + y + z ≤ 150 x + y + z ≥ 100 x ≥ 0, y ≥ 0, z ≥ 0. p= (x, y, z)=
Maximize P = x + 4y subject to x + y ≤ 4 2x + y ≤ 5 x ≥ 0, y ≥ 0
Please show how to solve b
Chapter 5. (M/M/s/K Model). Leia is responsible for 13 data units in the IT offices in a small business called DataWish. Each data unit runs on an average for 3 weeks and requires an average of ½ or 0.5 weeks to get reset by Leia before it can start up again. If we assign the Poisson distribution to the “arrival” of each data unit for service and an exponential distribution to the actual service provided, answer the following questions: a. The arrival rate would be units per week and the service rate would be units per week. b. Calculate the following operating characteristics for the M/M/s/K system: Utilization Factor (ρ) % Performance Measures P0 (probability that sytem is empty) % L (average units in system) units Lq (average units waiting in queue) units W (average time in the system) weeks Wq (average time in the queue) weeks c. If we assign a cost of waiting as $400 per week per data unit and $800 per…

SEE MORE QUESTIONS

Recommended textbooks for you

Practical Management Science

Operations Management

ISBN:

9781337406659

Author:

WINSTON, Wayne L.

Publisher:

Cengage,

Practical Management Science

Operations Management

ISBN:

9781337406659

Author:

WINSTON, Wayne L.

Publisher:

Cengage,

SEE MORE TEXTBOOKS

Draw the network for this transportation problem. (Let X;; represent the flow from node / to node j.) Min 2x13 + 4x₁ 14 + 4X15 + 10X23 + 11x24 + 11x25 s.t. + X15 ≤ 500 X13 + X14 + X23 + x24 + X25 $ 400 X13 + x23 = 300 200