Question 1

The branching part of the branch and bound algorithm that Solver uses to solve integer programming models means that the algorithm:

Accepted Answer

A)   creates subsets of solutions through which to search
B)   searches through only a limited set of feasible integer solutions
C)   identifies an incumbent solution which is optimal
D)   uses a decision tree to find the optimal solution A

Question 2

Exhibit 6-1
A recent college graduate is planning to move cross country from her college town to the city where her first job is located.She has rented a truck that can haul up to 1100 cubic feet of furniture.The volume and value of each item she is considering moving on the truck are given below. 
-Refer to Exhibit 6-1.This problem is an example of what type of integer programming model?

Accepted Answer

This is an integer programming model requiring binary variables (to indicate which items the graduate will move)and a single constraint (the capacity of the moving truck),therefore it is a knapsack problem.

Question 3

The binary variables in the fixed cost models correspond to:

Accepted Answer

A)   the number of units or products produced
B)   the total profit
C)   the amount of labor hours
D)   a process for which a fixed cost occurs D

Question 4

Rounding the solution of a linear programming to the nearest integer values provides an:

Accepted Answer

A)   integer solution that is optimal
B)   integer solution that is not optimal
C)   integer solution that might be optimal
D)   infeasible solution

Question 5

The higher the upper bound produced in the branch and bound solution process,the faster the algorithm will be.

Accepted Answer

A) True 
 B)False

Question 6

Exhibit 6-1
A recent college graduate is planning to move cross country from her college town to the city where her first job is located.She has rented a truck that can haul up to 1100 cubic feet of furniture.The volume and value of each item she is considering moving on the truck are given below. 
-Refer to Exhibit 6-1.Which items should she take with her to her new home? What is the value of these items?

Accepted Answer

The answer of Exhibit 6-1
A recent college graduate is planning...

Question 7

Many inherently nonlinear problems can be transformed into linear models with the use of:

Accepted Answer

A)   integer variables
B)   integer constraints
C)   binary variables
D)   binary constraints

Question 8

Fixed costs imply that the divisibility assumption of linear models no longer holds.

Accepted Answer

A) True 
 B)False

Question 9

Exhibit 6-3
PharmaCo wants to determine how to deploy sales representatives across its Western U.S.region to support a new drug for obesity.Sales representatives will be located in a "home city",which they serve,in addition to cities with feasible commuting distance,with the objective that all cities must be served by at least one sales representative.The feasible connections between each city in the region are listed below (1 indicates a feasible connection): 
-Refer to Exhibit 6-3.Suppose PharmaCo wants to have a backup for each city.What is the minimum number of representatives that can cover this region in that case? What are their home cities?

Accepted Answer

The answer of Exhibit 6-3
PharmaCo wants to determine how to...

Question 10

The LP relaxation of an integer programming (IP)problem is typically easy to solve and provides a bound for the IP model.

Accepted Answer

A) True 
 B)False

Question 11

Exhibit 6-2
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 variable unit costs of shipping between the respective plants are shown in the table below:
  In addition to the variable unit costs of shipping,Sinclair incurs a fixed handling cost (of pickup and delivery)for any shipping routes it uses.These costs are discounted for longer routes,as shown below: 
-Refer to Exhibit 6-2.This problem is an example of what type of integer programming model?

Accepted Answer

The answer of Exhibit 6-2
Sinclair Plastics operates two chemical plants...

Question 12

Exhibit 6-2
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 variable unit costs of shipping between the respective plants are shown in the table below:
  In addition to the variable unit costs of shipping,Sinclair incurs a fixed handling cost (of pickup and delivery)for any shipping routes it uses.These costs are discounted for longer routes,as shown below: 
-Refer to Exhibit 6-2.What is Sinclair's optimal shipping plan? What is the total cost in that case?

Accepted Answer

The answer of Exhibit 6-2
Sinclair Plastics operates two chemical plants...

Question 13

Exhibit 6-2
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 variable unit costs of shipping between the respective plants are shown in the table below:
  In addition to the variable unit costs of shipping,Sinclair incurs a fixed handling cost (of pickup and delivery)for any shipping routes it uses.These costs are discounted for longer routes,as shown below: 
-Refer to Exhibit 6-2.Suppose the shipping capacity for all routes is 3000 tons per month.What is Sinclair's optimal shipping plan in that case? What is the total cost in that case?

Accepted Answer

The answer of Exhibit 6-2
Sinclair Plastics operates two chemical plants...

Question 14

Complete enumeration of all possible solutions in many integer programming problems is impractical.

Accepted Answer

A) True 
 B)False

Question 15

During the solution of a problem with the branch and bound algorithm,an incumbent solution represents an upper bound on the solution.

Accepted Answer

A) True 
 B)False

Question 16

Problems with a fixed cost that is incurred only if an activity is undertaken at a positive level are inherently nonlinear.

Accepted Answer

A) True 
 B)False

Question 17

If Solver fails to find an optimal solution to an integer programming problem,we might be able to find a near optimal solution by decreasing the tolerance setting.

Accepted Answer

A) True 
 B)False

Question 18

Exhibit 6-3
PharmaCo wants to determine how to deploy sales representatives across its Western U.S.region to support a new drug for obesity.Sales representatives will be located in a "home city",which they serve,in addition to cities with feasible commuting distance,with the objective that all cities must be served by at least one sales representative.The feasible connections between each city in the region are listed below (1 indicates a feasible connection): 
-Refer to Exhibit 6-3.This problem is an example of what type of integer programming model?

Accepted Answer

The answer of Exhibit 6-3
PharmaCo wants to determine how to...

Question 19

Exhibit 6-2
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 variable unit costs of shipping between the respective plants are shown in the table below:
  In addition to the variable unit costs of shipping,Sinclair incurs a fixed handling cost (of pickup and delivery)for any shipping routes it uses.These costs are discounted for longer routes,as shown below: 
-Refer to Exhibit 6-2.What problem will occur if we use an IF statement to model the fixed handling costs?

Accepted Answer

The answer of Exhibit 6-2
Sinclair Plastics operates two chemical plants...

Question 20

Optimization software,including Solver,typically has more difficulty solving an integer programming problem,relative to a linear programming problem.

Accepted Answer

A) True 
 B)False

Exam 6: Optimization Models With Integer Variables

The branching part of the branch and bound algorithm that Solver uses to solve integer programming models means that the algorithm:

The binary variables in the fixed cost models correspond to:

Rounding the solution of a linear programming to the nearest integer values provides an:

The higher the upper bound produced in the branch and bound solution process,the faster the algorithm will be.

Many inherently nonlinear problems can be transformed into linear models with the use of:

Fixed costs imply that the divisibility assumption of linear models no longer holds.

The LP relaxation of an integer programming (IP)problem is typically easy to solve and provides a bound for the IP model.

Complete enumeration of all possible solutions in many integer programming problems is impractical.

During the solution of a problem with the branch and bound algorithm,an incumbent solution represents an upper bound on the solution.

Problems with a fixed cost that is incurred only if an activity is undertaken at a positive level are inherently nonlinear.

If Solver fails to find an optimal solution to an integer programming problem,we might be able to find a near optimal solution by decreasing the tolerance setting.

Optimization software,including Solver,typically has more difficulty solving an integer programming problem,relative to a linear programming problem.