Question 1

-For the shortest route problem described in Table M2-3, which arcs comprise the shortest route?

Accepted Answer

A) 1-2, 2-6, 6-8 
B) 1-5, 5-8 
C) 1-2, 2-5, 5-8 
D) 1-3, 3-5, 5-8 
A) 1-2, 2-6, 6-8 
B) 1-5, 5-8 
C) 1-2, 2-5, 5-8 
D) 1-3, 3-5, 5-8

Question 2

There are seven cities (City 1-City 7) served by Acme Trucking. Route availability is limited. The distances, in hundreds of miles, are given in the table below for each route.
 
-What is the minimum distance a load being moved from City 1 to City 7 must travel?

Accepted Answer

A) 3000 miles 
B) 2900 miles 
C) 1500 miles 
D) 2700 miles 
A) 3000 miles 
B) 2900 miles 
C) 1500 miles 
D) 2700 miles

Question 3

If dynamic programming were used to solve for the minimum distance from City 1 to City 6 above, how many stages would there be?

Accepted Answer

A) 6 
B) 5 
C) 4 
D) 3 
A) 6 
B) 5 
C) 4 
D) 3

Question 4

There are six cities (City 1-City 6) serviced by a particular airline. Limited routes are available, and the distances for each of these routes are presented in the table below.
 
-Which nodes are involved in the shortest distance between City 1 and City 6?

Accepted Answer

A) 1-2-4-6 
B) 1-2-5-6 
C) 1-3-4-6 
D) 1-3-5-6 
A) 1-2-4-6 
B) 1-2-5-6 
C) 1-3-4-6 
D) 1-3-5-6

Question 5

-For the shortest route problem described in Table M2-4, which arcs comprise the shortest route?

Accepted Answer

A) 1-2, 2-6, 6-8 
B) 1-3, 3-5, 5-8 
C) 1-5, 5-8 
D) 1-2, 2-4, 4-7, 7-8 
A) 1-2, 2-6, 6-8 
B) 1-3, 3-5, 5-8 
C) 1-5, 5-8 
D) 1-2, 2-4, 4-7, 7-8

Question 6

-Using the data in Table M2-5, determine the optimal arc of stage 1.

Accepted Answer

A) 3 - 7 
B) 6 - 7 
C) 5 - 7 
D) 4 - 7 
A) 3 - 7 
B) 6 - 7 
C) 5 - 7 
D) 4 - 7

-For the shortest route problem described in Table M2-3, which arcs comprise the shortest route?

There are seven cities (City 1-City 7) served by Acme Trucking. Route availability is limited. The distances, in hundreds of miles, are given in the table below for each route. -What is the minimum distance a load being moved from City 1 to City 7 must travel?

If dynamic programming were used to solve for the minimum distance from City 1 to City 6 above, how many stages would there be?

There are six cities (City 1-City 6) serviced by a particular airline. Limited routes are available, and the distances for each of these routes are presented in the table below. -Which nodes are involved in the shortest distance between City 1 and City 6?

-For the shortest route problem described in Table M2-4, which arcs comprise the shortest route?

-Using the data in Table M2-5, determine the optimal arc of stage 1.

Introduction to Quantitative Analysis

Probability Concepts and Applications

Decision Analysis

Regression Models

Forecasting

Inventory Control Models

Linear Programming Models: Graphical and Computer Methods

Linear Programming Applications

Transportation, Assignment, and Network Models

Integer Programming, Goal Programming, and Nonlinear Programming

Project Management

Waiting Lines and Queuing Theory Models

Simulation Modeling

Markov Analysis

Statistical Quality Control

Analytic Hierarchy Process

Decision Theory and the Normal Distribution

Game Theory

Mathematical Tools: Determinants and Matrices

Calculus-Based Optimization

Linear Programming: The Simplex Method

Transportation, Assignment, and Network Algorithms

Filters

Exam 17: Dynamic Programming

-For the shortest route problem described in Table M2-3, which arcs comprise the shortest route?

There are seven cities (City 1-City 7) served by Acme Trucking. Route availability is limited. The distances, in hundreds of miles, are given in the table below for each route. -What is the minimum distance a load being moved from City 1 to City 7 must travel?

If dynamic programming were used to solve for the minimum distance from City 1 to City 6 above, how many stages would there be?

There are six cities (City 1-City 6) serviced by a particular airline. Limited routes are available, and the distances for each of these routes are presented in the table below. -Which nodes are involved in the shortest distance between City 1 and City 6?

-For the shortest route problem described in Table M2-4, which arcs comprise the shortest route?

-Using the data in Table M2-5, determine the optimal arc of stage 1.

Introduction to Quantitative Analysis

Probability Concepts and Applications

Decision Analysis

Regression Models

Forecasting

Inventory Control Models

Linear Programming Models: Graphical and Computer Methods

Linear Programming Applications

Transportation, Assignment, and Network Models

Integer Programming, Goal Programming, and Nonlinear Programming

Project Management

Waiting Lines and Queuing Theory Models

Simulation Modeling

Markov Analysis

Statistical Quality Control

Analytic Hierarchy Process

Decision Theory and the Normal Distribution

Game Theory

Mathematical Tools: Determinants and Matrices

Calculus-Based Optimization

Linear Programming: The Simplex Method

Transportation, Assignment, and Network Algorithms

Filters