Question 1

The branch and bound algorithm uses:

Accepted Answer

A)  lower bounds 
B)  upper bounds 
C)  both upper and lower bounds 
D)  neither upper or lower bounds 
A)  lower bounds 
B)  upper bounds 
C)  both upper and lower bounds 
D)  neither upper or lower bounds

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

In a model with 8 changing cells,all of which are constrained to be binary,the number of potentially feasible solutions is:

Accepted Answer

A)  4 
B)  8 
C)  64 
D)  256 
A)  4 
B)  8 
C)  64 
D)  256

Question 4

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 5

In a linear model,the target cell and constraints are ultimately:

Accepted Answer

A)  a product of changing cells 
B)  a sum of products of changing cells 
C)  a product of constants and changing cells 
D)  a sum of products of constants and changing cells 
A)  a product of changing cells 
B)  a sum of products of changing cells 
C)  a product of constants and changing cells 
D)  a sum of products of constants and changing cells

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.Suppose she can save $400 by renting a smaller truck,which has only 800 cubic feed of capacity.Would she be better off with the smaller truck?

Accepted Answer

The revised knapsack model is shown belo

Question 7

An algorithm which uses implicit enumeration:

Accepted Answer

A)  is impractical 
B)  examines all possible solutions 
C)  does not guarantee that some of the solutions not examined could be optimal 
D)  excludes many possible solutions that guaranteed to be suboptimal 
A)  is impractical 
B)  examines all possible solutions 
C)  does not guarantee that some of the solutions not examined could be optimal 
D)  excludes many possible solutions that guaranteed to be suboptimal

Question 8

In a set-covering model,each member of a given set (set 1)must be "covered" by all members of another set (set 2).

Accepted Answer

A) True 
 B)False

The branch and bound algorithm uses:

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

In a model with 8 changing cells,all of which are constrained to be binary,the number of potentially feasible solutions is:

In a linear model,the target cell and constraints are ultimately:

An algorithm which uses implicit enumeration:

In a set-covering model,each member of a given set (set 1)must be "covered" by all members of another set (set 2).

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

Inventory Models

Queuing Models

Regression and Forecasting Models

Filters

Exam 6: Optimization Models With Integer Variables

The branch and bound algorithm uses:

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

In a model with 8 changing cells,all of which are constrained to be binary,the number of potentially feasible solutions is:

In a linear model,the target cell and constraints are ultimately:

An algorithm which uses implicit enumeration:

In a set-covering model,each member of a given set (set 1)must be "covered" by all members of another set (set 2).

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

Inventory Models

Queuing Models

Regression and Forecasting Models

Filters