Question 1

.
-Binary integer programming can be used for:

Accepted Answer

A) capital budgeting 
B) site selection 
C) scheduling asset divestitures 
D) assignments of routes 
E) All of the above 
A) capital budgeting 
B) site selection 
C) scheduling asset divestitures 
D) assignments of routes 
E) All of the above

Question 2

A parameter analysis report can be used to perform sensitivity analysis for integer programming problems

Accepted Answer

A) True 
 B)False

Question 3

Binary variables can have the following values:

Accepted Answer

A) 0 
B) 1 
C) any integer value 
D) a and b only 
E) All of the above 
A) 0 
B) 1 
C) any integer value 
D) a and b only 
E) All of the above

Question 4

In a BIP problem with 2 mutually exclusive alternatives,x1 and x2,the following constraint needs to be added to the formulation if one alternative must be chosen:

Accepted Answer

A) x1 + x2 ≤ 1 
B) x1 + x2 = 1 
C) x1 - x2 ≤ 1 
D) x1 - x2 = 1 
E) None of the above 
A) x1 + x2 ≤ 1 
B) x1 + x2 = 1 
C) x1 - x2 ≤ 1 
D) x1 - x2 = 1 
E) None of the above

Question 5

In a BIP problem with 2 mutually exclusive alternatives,x1 and x2,the following constraint needs to be added to the formulation:

Accepted Answer

A) x1 + x2 ≤ 1 
B) x1 + x2 ≥ 1 
C) x1 - x2 ≤ 1 
D) x1 - x2 = 1 
E) None of the above 
A) x1 + x2 ≤ 1 
B) x1 + x2 ≥ 1 
C) x1 - x2 ≤ 1 
D) x1 - x2 = 1 
E) None of the above

Question 6

Variables whose only possible values are 0 and 1 are called integer variables

Accepted Answer

A) True 
 B)False

Question 7

The algorithms available for solving BIP problems are much more efficient than those for linear programming which is one of the advantages of formulating problems this way

Accepted Answer

A) True 
 B)False

Question 8

It is possible to have a constraint in a BIP that excludes the possibility of choosing none of the alternatives available

Accepted Answer

A) True 
 B)False

. -Binary integer programming can be used for:

A parameter analysis report can be used to perform sensitivity analysis for integer programming problems

Binary variables can have the following values:

In a BIP problem with 2 mutually exclusive alternatives,x₁ and x₂,the following constraint needs to be added to the formulation if one alternative must be chosen:

In a BIP problem with 2 mutually exclusive alternatives,x₁ and x₂,the following constraint needs to be added to the formulation:

Variables whose only possible values are 0 and 1 are called integer variables

The algorithms available for solving BIP problems are much more efficient than those for linear programming which is one of the advantages of formulating problems this way

It is possible to have a constraint in a BIP that excludes the possibility of choosing none of the alternatives available

Introduction

Linear programming: Basic Concepts

Linear programming: Formulation and applications

Theart of modeling with spread sheets

What-If Analysis for linear programming

Network optimization problems

Non linear programming

Decision Analysis

Forecasting

Queuing models

Computer simulation: Basic Concepts

Computer simulation with risks olver platform

Solution concepts for linear programming

Transportation and assignment problems

Pert CPM models for project management

Goal programming

Inventory management with known demand

Inventory management with uncertain demand

Computer simulation with crystal ball

Filters

Exam 7: Using binary integer programming to deal withy es-Or-No decisions

. -Binary integer programming can be used for:

A parameter analysis report can be used to perform sensitivity analysis for integer programming problems

Binary variables can have the following values:

In a BIP problem with 2 mutually exclusive alternatives,x1 and x2,the following constraint needs to be added to the formulation if one alternative must be chosen:

In a BIP problem with 2 mutually exclusive alternatives,x1 and x2,the following constraint needs to be added to the formulation:

Variables whose only possible values are 0 and 1 are called integer variables

The algorithms available for solving BIP problems are much more efficient than those for linear programming which is one of the advantages of formulating problems this way

It is possible to have a constraint in a BIP that excludes the possibility of choosing none of the alternatives available

Introduction

Linear programming: Basic Concepts

Linear programming: Formulation and applications

Theart of modeling with spread sheets

What-If Analysis for linear programming

Network optimization problems

Non linear programming

Decision Analysis

Forecasting

Queuing models

Computer simulation: Basic Concepts

Computer simulation with risks olver platform

Solution concepts for linear programming

Transportation and assignment problems

Pert CPM models for project management

Goal programming

Inventory management with known demand

Inventory management with uncertain demand

Computer simulation with crystal ball

Filters

In a BIP problem with 2 mutually exclusive alternatives,x₁ and x₂,the following constraint needs to be added to the formulation if one alternative must be chosen:

In a BIP problem with 2 mutually exclusive alternatives,x₁ and x₂,the following constraint needs to be added to the formulation: