A company needs to ship 100 units from Roanoke to Washington at the lowest possible cost. The costs associated with shipping between the cities are: $\quad $$\quad $$\quad $$\quad $$\quad $$\quad $$\quad $$\quad $$\quad $$\quad $$\quad $$\quad $$\quad $$\quad $$\quad $$\quad $$ \text {To}$ $\begin{array} { l c c c } \text { From } & \text { Lexington } & \text { Washingtan } & \text { Charlottesville } \\ \hline \text { Roanoke } & 50 & - & 80 \\ \text { Lexington } & - & 50 & 40 \\ \text { Charlotterville } & - & 30 & \end{array}$ Draw the network representation of this problem.

The answer of A company needs to ship 100 units...

Draw the network representation of the following network flow problem. MIN:$\begin{array} { l } 5 \mathbf { X } _ { 1 \mathbf { 4 } } + 3 \mathbf { X } _ { 1 \mathbf { 3 } } + 2 \mathbf { X } _ { 14 } + 3 \mathbf { X } _ { \mathbf { 4 4 } } + 2 \mathbf { X } _ { \mathbf { 3 4 } } \\ \end{array}$ Subject to: $\begin{array} { l } - \mathbf { X } _ { 1 \mathbf { 1 } } - \mathbf { X } _ { 1 \mathbf { 1 } } - \mathbf { X } _ { 14 } = - 10 \\ \mathbf { X } _ { 1 \mathbf { 2 } } - \mathbf { X } _ { \mathbf { 2 4 } } = \mathbf { 2 } \\ \mathbf { X } _ { 1 \mathbf { 3 } } - \mathbf { X } _ { \mathbf { 3 4 } } = \mathbf { 3 } \\ \mathbf { X } _ { 14 } + \mathbf { X } _ { \mathbf { 2 4 } } + \mathbf { X } _ { \mathbf { 3 4 } } = 5 \\ \mathbf { X } _ { \mathrm { ij } } \geq \mathbf { a } \text { far all } i \text { and } j \end{array}$

The answer of Draw the network representation of the following...

Exam 5: Network Modeling

A company needs to ship 100 units from Roanoke to Washington at the lowest possible cost. The costs associated with shipping between the cities are: $\quad$ $\quad$ $\quad$ $\quad$ $\quad$ $\quad$ $\quad$ $\quad$ $\quad$ $\quad$ $\quad$ $\quad$ $\quad$ $\quad$ $\quad$ $\quad$ $\text {To}$ From Lexington Washingtan Charlottesville Roanoke 50 - 80 Lexington - 50 40 Charlotterville - 30 Draw the network representation of this problem.

(Essay)

4.9/5

(41)

Question 61

Draw the network representation of the following network flow problem. MIN: 5+3+2+3+2 Subject to: ---=-10 -= -= ++=5 \geq far all i and j

(Essay)

4.9/5

(30)

Question 62

An oil company wants to create lube oil, gasoline and diesel fuel at two refineries. There are two sources of crude oil. Consider arc 2-4. The per unit shipping cost of crude B from source 2 (node 2) to refinery 2 (node 4) is $11 and the yield is 85 percent. The following network representation depicts this problem. What is the balance of flow constraint for node 3 (Refinery 1)?

(Multiple Choice)

5.0/5

(36)

Question 63

A manufacturing company has a pool of 50 labor hours. A customer has requested two products, Product A and Product B, and has requested 15 and 20 of each respectively. It requires 2 hours of labor to produce Product A and 3 hours of labor to produce Product B. The company can obtain up to 50 additional hours of labor if required. In-house labor costs $25 per hour while contracted labor costs $45 per hour. The following network flow model captures this problem. Write out the LP formulation for this problem.

(Essay)

4.8/5

(32)

Question 64

Supply quantities for supply nodes in a transshipment problem are customarily indicated by

(Multiple Choice)

5.0/5

(33)

Question 65

The number of constraints in network flow problems is determined by the number of

(Multiple Choice)

4.8/5

(33)

Question 66

A company wants to determine the optimal replacement policy for its photocopier. The company does not keep photocopiers longer than 4 years. The company has estimated the annual costs for photocopiers during each of the 4 years and developed the following network representation of the problem. Write out the LP formulation for this problem.

(Essay)

4.7/5

(38)

Question 67

An oil company wants to create lube oil, gasoline and diesel fuel at two refineries. There are two sources of crude oil. The following Excel spreadsheet shows this problem. What formula should be entered in cell E6 (and copied to cells E7:E15) in this spreadsheet?

(Short Answer)

4.9/5

(37)

Question 68

Demand quantities for demand nodes in a transshipment problem are customarily indicated by

(Multiple Choice)

4.8/5

(40)

Question 69

An oil company wants to create lube oil, gasoline and diesel fuel at two refineries. There are two sources of crude oil. The following network representation depicts this problem. Write out the LP formulation for this problem.

(Essay)

4.8/5

(41)

Question 70

An oil company wants to create lube oil, gasoline and diesel fuel at two refineries. There are two sources of crude oil. Consider arc 2-4. The per unit shipping cost of crude B from source 2 (node 2) to refinery 2 (node 4) is $11 and the yield is 85 percent. The following flowchart depicts this problem. What is the balance of flow constraint for node 7 (Diesel)?

(Multiple Choice)

4.8/5

(33)

Question 71

Which method is preferred for solving minimal spanning tree problems?

(Multiple Choice)

4.8/5

(44)

Question 72

Showing 61 - 72 of 72

Draw the network representation of the following network flow problem. MIN: 5+3+2+3+2 Subject to: ---=-10 -= -= ++=5 \geq far all i and j

Supply quantities for supply nodes in a transshipment problem are customarily indicated by

The number of constraints in network flow problems is determined by the number of

An oil company wants to create lube oil, gasoline and diesel fuel at two refineries. There are two sources of crude oil. The following Excel spreadsheet shows this problem. What formula should be entered in cell E6 (and copied to cells E7:E15) in this spreadsheet?

Demand quantities for demand nodes in a transshipment problem are customarily indicated by

An oil company wants to create lube oil, gasoline and diesel fuel at two refineries. There are two sources of crude oil. The following network representation depicts this problem. Write out the LP formulation for this problem.

Which method is preferred for solving minimal spanning tree problems?

Introduction to Modeling and Decision Analysis

Introduction to Optimization and Linear Programming

Modeling and Solving Lp Problems in a Spreadsheet

Sensitivity Analysis and the Simplex Method

Integer Linear Programming

Goal Programming and Multiple Objective Optimization

Nonlinear Programming and Evolutionary Optimization

Regression Analysis

Discriminant Analysis

Time Series Forecasting

Introduction to Simulation Using Risk Solver Platform

Queuing Theory

Decision Analysis

Project Management Online

Filters