Question 1

In transportation problems,the three sets of input numbers that are required are capacities,demands and flows.

Accepted Answer

A) True 
 B)False

Question 2

Exhibit 5-3
Steve the auto parts salesman is trying to navigate his way between the rural west Texas towns of Jonestown and Upland. The possible routes for this trip are shown below, along with the mileage along each route.
   $\begin{array}{lrcc}
\text { Origin } & & \text { Destination } & \text { Distance (miles) } \
\text { Jonestown } & \text { to } & \text { Haleyville } & 25 \
\text { Jonestown } & \text { to } & \text { Krickburg } & 55 \
\text { Jonestown } & \text { to } & \text { Karn City } & 35 \
\text { Haleyville } & \text { to } & \text { Mart } & 50 \
\text { Haleyville } & \text { to } & \text { Krickburg } & 25 \
\text { Haleyville } & \text { to } & \text { Karn City } & 30 \
\text { Karn City } & \text { to } & \text { Mart } & 50 \
\text { Karn City } & \text { to } & \text { Baker } & 65 \
\text { Krickburg } & \text { to } & \text { Karn City } & 20 \
\text { Krickburg } & \text { to } & \text { Baker } & 30 \
\text { Krickburg } & \text { to } & \text { Mart } & 45 \
\text { Mart } & \text { to } & \text { Baker } & 20 \
\text { Mart } & \text { to } & \text { Upland } & 40 \
\text { Baker } & \text { to } & \text { Upland } & 30
\end{array}$
-Refer to Exhibit 5-3.Suppose the roads leading into and out of Krickburg are unpaved,so Steve would only be able to travel half of his usual 60 mile/hour speed on those routes.Modify the model to account for this condition.Would the shortest path change from the base case solution

Accepted Answer

The revised shortest path (in

Question 3

Exhibit 5-1
Sinclair Plastics operates two chemical plants which produce polyethylene; the Ohio Valley plant which can produce up to 10,000 tons per month and the Lakeview plant which can produce up to 7,000 tons per month. Sinclair sells its polyethylene to three different auto manufacturing plants, Grand Rapids (demand = 3000 tons per month), Blue Ridge (demand = 5000 tons per month), and Sunset (demand = 4000 tons per month). The costs of shipping between the respective plants is shown in the table below:
 $$\begin{array} { | l | l | l | l | } 
\hline & \text { Grand Rapids } & \text { Blue Ridge } & \text { Sunset } \
\hline \text { Ohio Valley } & 50 & 40 & 100 \
\hline \text { Lakeview } & 60 & 50 & 75 \
\hline
\end{array}$$
-Refer to Exhibit 5-1.Formulate (write out algebraically)an LP transportation model to help Sinclair minimize its shipping costs.

Accepted Answer

Let the decision var

Question 4

For all routes with positive flows in an optimized transportation problem,the reduced cost will be:

Accepted Answer

A)  zero 
B)  how much less shipping costs would have to be for shipments to occur along that route 
C)  how much more shipping costs would have to be for shipments to occur along that route 
D)  how much the capacity is along that shipping route 
A)  zero 
B)  how much less shipping costs would have to be for shipments to occur along that route 
C)  how much more shipping costs would have to be for shipments to occur along that route 
D)  how much the capacity is along that shipping route

Question 5

The cost of an arc in a shortest path problem is not necessarily equal to the distance of the arc.

Accepted Answer

A) True 
 B)False

Question 6

Exhibit 5-3
Steve the auto parts salesman is trying to navigate his way between the rural west Texas towns of Jonestown and Upland. The possible routes for this trip are shown below, along with the mileage along each route.
   $\begin{array}{lrcc}
\text { Origin } & & \text { Destination } & \text { Distance (miles) } \
\text { Jonestown } & \text { to } & \text { Haleyville } & 25 \
\text { Jonestown } & \text { to } & \text { Krickburg } & 55 \
\text { Jonestown } & \text { to } & \text { Karn City } & 35 \
\text { Haleyville } & \text { to } & \text { Mart } & 50 \
\text { Haleyville } & \text { to } & \text { Krickburg } & 25 \
\text { Haleyville } & \text { to } & \text { Karn City } & 30 \
\text { Karn City } & \text { to } & \text { Mart } & 50 \
\text { Karn City } & \text { to } & \text { Baker } & 65 \
\text { Krickburg } & \text { to } & \text { Karn City } & 20 \
\text { Krickburg } & \text { to } & \text { Baker } & 30 \
\text { Krickburg } & \text { to } & \text { Mart } & 45 \
\text { Mart } & \text { to } & \text { Baker } & 20 \
\text { Mart } & \text { to } & \text { Upland } & 40 \
\text { Baker } & \text { to } & \text { Upland } & 30
\end{array}$
-Refer to Exhibit 5-3.Implement the appropriate model in Solver and determine the shortest path for Steve.How many total miles will he travel on his trip

Accepted Answer

The optimized shortest path mo

Question 7

Exhibit 5-2
A small engineering firm employs one civil engineer, two engineering technicians, and one summer intern. The types of projects the firm does includes surveys (typically 7 per month), designs (5 per month), and construction project plans (four per month). The times, in hours, required for each employee to complete teach type of project are shown below. Based on their capabilities and time spent on travel and administrative tasks, the engineer, tech 1, tech 2, and intern can handle 5, 4, 4, and 3 projects per month, respectively.
 ​  
-Refer to Exhibit 5-2.Suppose Tech 2 will not be available during the next month.Keeping the same number of design and construction plan projects,how many survey projects would the firm be able to do
 What would be the revised assignment plan in that case

Accepted Answer

The number of survey jobs must be reduce

Question 8

The graphical representation of a network in an optimization problem can be an aid in the development of a spreadsheet model.

Accepted Answer

A) True 
 B)False

Question 9

Exhibit 5-2
A small engineering firm employs one civil engineer, two engineering technicians, and one summer intern. The types of projects the firm does includes surveys (typically 7 per month), designs (5 per month), and construction project plans (four per month). The times, in hours, required for each employee to complete teach type of project are shown below. Based on their capabilities and time spent on travel and administrative tasks, the engineer, tech 1, tech 2, and intern can handle 5, 4, 4, and 3 projects per month, respectively.
 ​  
-Refer to Exhibit 5-2.Implement a LP model in Solver and determine the optimal monthly assignment plan for the firm.What is the total number of hours that will be assigned to projects each month

Accepted Answer

The optimized model below show

Question 10

Exhibit 5-1
Sinclair Plastics operates two chemical plants which produce polyethylene; the Ohio Valley plant which can produce up to 10,000 tons per month and the Lakeview plant which can produce up to 7,000 tons per month. Sinclair sells its polyethylene to three different auto manufacturing plants, Grand Rapids (demand = 3000 tons per month), Blue Ridge (demand = 5000 tons per month), and Sunset (demand = 4000 tons per month). The costs of shipping between the respective plants is shown in the table below:
 $$\begin{array} { | l | l | l | l | } 
\hline & \text { Grand Rapids } & \text { Blue Ridge } & \text { Sunset } \
\hline \text { Ohio Valley } & 50 & 40 & 100 \
\hline \text { Lakeview } & 60 & 50 & 75 \
\hline
\end{array}$$
-Refer to Exhibit 5-1.Suppose the shipping capacity between any two plants was limited to 2500 tons per month.Design and implement a network flow version of this model in Solver and obtain the optimal shipping plan.How much more would the shipping plan cost Sinclair in that case

Accepted Answer

The optimized model below show

In transportation problems,the three sets of input numbers that are required are capacities,demands and flows.

For all routes with positive flows in an optimized transportation problem,the reduced cost will be:

The cost of an arc in a shortest path problem is not necessarily equal to the distance of the arc.

The graphical representation of a network in an optimization problem can be an aid in the development of a spreadsheet model.

Introduction to Modeling

Introduction to Spreadsheet Modeling

Introduction to Optimization Modeling

Linear Programming Models

Optimization Models With Integer Variables

Nonlinear Optimization Models

Evolutionary Solver: An Alternative Optimization Procedure

Decision Making Under Uncertainty

Introduction to Simulation Modeling

Simulation Models

Queueing Models

Regression and Forecasting Models

Data Mining

Filters

Exam 5: Network Models

In transportation problems,the three sets of input numbers that are required are capacities,demands and flows.

For all routes with positive flows in an optimized transportation problem,the reduced cost will be:

The cost of an arc in a shortest path problem is not necessarily equal to the distance of the arc.

The graphical representation of a network in an optimization problem can be an aid in the development of a spreadsheet model.

Introduction to Modeling

Introduction to Spreadsheet Modeling

Introduction to Optimization Modeling

Linear Programming Models

Optimization Models With Integer Variables

Nonlinear Optimization Models

Evolutionary Solver: An Alternative Optimization Procedure

Decision Making Under Uncertainty

Introduction to Simulation Modeling

Simulation Models

Queueing Models

Regression and Forecasting Models

Data Mining

Filters