Question 1

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 
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

Question 2

Solver may be unable to solve some integer programming problems,even when they have an optimal solution.

Accepted Answer

A) True 
 B)False

Question 3

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.Formulate an integer programming model to identify a feasible deployment plan to the sales representatives.What is the minimum number of representatives that can cover this region
 What are their home cities

Accepted Answer

PharmaCo will need to deploy 2

Question 4

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)  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

Question 5

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 cost of shipping a ton is $1 per mile. The number of miles between the respective plants is 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:
 $$\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}$$ 
$\begin{array}{c}
\text { Fixed Cost Levels }\
\begin{array}{lll}
\text { Distance (mi)}&\text { Fixed Cost } \
<=25 & \$ 100,000 \
<=50 & \$ 60,000 \
<=75 & \$ 20,000 \
<=100 & \$ 0
\end{array}

\end{array}$

-Refer to Exhibit 6-2.What problem will occur if we use an IF statement to model the fixed handling costs

Accepted Answer

The success of a model using I

Question 6

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 cost of shipping a ton is $1 per mile. The number of miles between the respective plants is 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:
 $$\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}$$ 
$\begin{array}{c}
\text { Fixed Cost Levels }\
\begin{array}{lll}
\text { Distance (mi)}&\text { Fixed Cost } \
<=25 & \$ 100,000 \
<=50 & \$ 60,000 \
<=75 & \$ 20,000 \
<=100 & \$ 0
\end{array}

\end{array}$

-Refer to Exhibit 6-2.This problem is an example of what type of integer programming model

Accepted Answer

This problem requires an integ

Question 7

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

Accepted Answer

A) True 
 B)False

Question 8

Any integer program involving 0 − 1 variables with ____ constraint(s)is called a knapsack problem.

Accepted Answer

A)  three 
B)  two 
C)  one 
D)  zero 
A)  three 
B)  two 
C)  one 
D)  zero

Question 9

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 10

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

This problem requires that every member

The binary variables in the fixed cost models correspond to:

Solver may be unable to solve some integer programming problems,even when they have an optimal solution.

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

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

Any integer program involving 0 − 1 variables with ____ constraint(s)is called a knapsack problem.

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

Introduction to Modeling

Introduction to Spreadsheet Modeling

Introduction to Optimization Modeling

Linear Programming Models

Network Models

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 6: Optimization Models With Integer Variables

The binary variables in the fixed cost models correspond to:

Solver may be unable to solve some integer programming problems,even when they have an optimal solution.

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

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

Any integer program involving 0 − 1 variables with ____ constraint(s)is called a knapsack problem.

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

Introduction to Modeling

Introduction to Spreadsheet Modeling

Introduction to Optimization Modeling

Linear Programming Models

Network Models

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