Question 1

A problem that has fixed cost as well as variable cost per unit, depending on the level of that activity, is usually formulated as a

Accepted Answer

A)  set covering problem 
B)  knapsack problem 
C)  fixed charge problem 
D)  traveling salesman problem 
A)  set covering problem 
B)  knapsack problem 
C)  fixed charge problem 
D)  traveling salesman problem

Question 2

An airport limousine service which parks all its limos at the airport can minimize its cost by using a proper order to pick up passengers from their houses and return to the airport using a

Accepted Answer

A)  set covering problem 
B)  traveling salesman problem 
C)  knapsack problem 
D)  fixed charge problem 
A)  set covering problem 
B)  traveling salesman problem 
C)  knapsack problem 
D)  fixed charge problem

Question 3

Problem A is a two-variable linear programming problem with a maximization objective function. Problem B is a two variable pure integer programming problem obtained from Problem A by requiring the variables to be integers and leaving all other things unchanged. If Problem A has an optimal solution with integer objective function value, then Problem B must have an optimal solution.

Accepted Answer

A) True 
 B)False

Question 4

Problem $\mathrm{A}$ is a two-variable linear programming problem with a maximization objective function. Problem B is a two-variable pure integer programming problem obtained from Problem A by requiring the variables to be integers and leaving all other things unchanged. If Problem A has an optimal solution with integer values for the variables, then the same solution must be optimal for Problem B as well.

Accepted Answer

A) True 
 B)False

Question 5

Market research corporation of Toledo Inc. (MRCT) has to finalize recommendation for the 2006 advertising campaign for Miracle Motors Inc. (MM), a major hydrogen-powered automobile manufacturer. MRCT has developed 5 distinct campaigns for MM Inc. MM Inc. has 7 distinct customer segments, and it wants all of its customers to be "hit" by at least one of its campaigns. It wants to minimize the total cost of reaching its customer base through these campaigns.

Accepted Answer

Decision variables: Let @#LAT-DLM&, for @#LAT-DLM& to 5 be @#LAT-DLM&

Question 6

A vehicle routing problem is a special case of the well-known traveling salesman problem

Accepted Answer

A) True 
 B)False

Question 7

For a typical integer programming problem, the number of feasible solutions

Accepted Answer

A)  increases linearly 
B)  increases exponentially 
C)  decreases exponentially 
D)  decreases linearly 
A)  increases linearly 
B)  increases exponentially 
C)  decreases exponentially 
D)  decreases linearly

Question 8

Problem $\mathrm{A}$ is a two-variable linear programming problem with a maximization objective function. Problem B is a two-variable pure integer programming problem obtained from Problem A by requiring the variables to be integers and leaving all other things unchanged. Assuming that both problems have optimal solutions, the objective function value of problem A will always be the objective function value of Problem B.

Accepted Answer

A)  greater than 
B)  less than 
C)  equal to 
D)  greater than or equal to 
E)  less than or equal to 
A)  greater than 
B)  less than 
C)  equal to 
D)  greater than or equal to 
E)  less than or equal to

Question 9

Set covering problem talks about a salesman and how he/she could cover a set of sales territories at minimal cost.

Accepted Answer

A) True 
 B)False

Question 10

Problems in which some variables are required to be integers are called

Accepted Answer

A)  pure integer programming problems 
B)  mixed integer programming problems 
C)  linear and integer programming problems 
D)  $0-1$ problems 
E)  yes-no type problems 
A)  pure integer programming problems 
B)  mixed integer programming problems 
C)  linear and integer programming problems 
D)  $0-1$ problems 
E)  yes-no type problems

Question 11

A two-variable pure integer programming problem cannot be solved by the graphical method.

Accepted Answer

A) True 
 B)False

Question 12

A retail outlet wants to replace a broken ice cream vending machine with one of two models. The purchase of model 1 is captured by variable X1. Taking a value of 1 and 0 would represent that machine 1 is not purchased. X2 is similarly defined. One of the constraints for this problem would be

Accepted Answer

A)  $\mathrm{X}_{1}+\mathrm{X}_{2}$1 
A)  $\mathrm{X}_{1}+\mathrm{X}_{2}$1

Question 13

In modeling a shopping mall construction problem, there are four potential locations giving rise to four 0-1 decision variables denoted as $X_{1}, X_{2}, X_{3}, X_{4}$, which take a value of 1 if a mall is constructed and 0 otherwise. Identify the correct set of constraint/s to satisfy the following condition/s: if a mall is constructed in location 2, then a mall should be constructed in location 4

Accepted Answer

A)  $\mathrm{X}_{2}-\mathrm{X}_{4} \leq$ 0. 
B)  $-X_{2}+X_{4} \geq$0. 
C)  $\mathrm{X}_{2}-\mathrm{X}_{4} \leq$ 0 
D)  $-\mathrm{X}_{2}+\mathrm{X}_{4} \leq$0 
A)  $\mathrm{X}_{2}-\mathrm{X}_{4} \leq$ 0. 
B)  $-X_{2}+X_{4} \geq$0. 
C)  $\mathrm{X}_{2}-\mathrm{X}_{4} \leq$ 0 
D)  $-\mathrm{X}_{2}+\mathrm{X}_{4} \leq$0

Question 14

A fixed charge problem models shops that incur a fixed cost for producing any positive quantity of a product and incur 0 cost if nothing is produced.

Accepted Answer

A) True 
 B)False

Question 15

A shopping complex is considering building a self-service vending machine island. The mall can buy a vending machine for dispensing various types of ready-to-pop corn. Purchase of this machine is captured by variable $\mathrm{X} 1$, taking a value of 1 and 0 if not purchased. There is also a machine available for popping any type of corn vended by the vending machine. Purchase of this machine is captured by variable X2, taking a value of 1 and 0 if not purchased. If they decide to buy the popcorn popper, then they must have the ready-to-pop corn vending machine. However, if they only buy the ready-to-pop corn vending machine, the customers can take the corn home or pop it in a microwave already available, if the popcorn popper is not purchased. The constraint that implements this will be

Accepted Answer

A)  $X_{1}-X_{2}$ 
A)  $X_{1}-X_{2}$

Question 16

Since the number of feasible solutions to a pure integer programming problem is a lot less than the number of feasible solutions to the corresponding linear programming problem (i.e. problem obtained by ignoring the integrality constraints), a pure integer programming problem must be easier to solve.

Accepted Answer

A) True 
 B)False

Question 17

Problems with variables that are yes-no types are called

Accepted Answer

A)  pure integer programming problems 
B)  linear programming problems 
C)  yes-no type problems 
D)  $0-1$ problems 
E)  binary linear problems 
A)  pure integer programming problems 
B)  linear programming problems 
C)  yes-no type problems 
D)  $0-1$ problems 
E)  binary linear problems

Question 18

A common feature of set covering, knapsack, and location problems is that all of them use mixed integer programming formulation requiring no $0-1$ variables.

Accepted Answer

A) True 
 B)False

Question 19

In modeling a shopping mall construction problem, there are four potential locations giving rise to four 0-1 decision variables, denoted as $X_{1}, X_{2}, X_{3}, X_{4}$,which take a value of 1 if a mall is constructed and 0 otherwise. Identify the correct set of constraint/s to satisfy the following condition/s: exactly one mall should be constructed among locations 1 and 3

Accepted Answer

A)  $\mathrm{X}_{1}+\mathrm{X}_{3} \leq$ 1 
B)  $\mathrm{X}_{1}+\mathrm{X}_{3} \geq$1 
C)  $X_{1}+X_{3}>$1 
D)  $X_{1}+X_{3}=$ 1 
A)  $\mathrm{X}_{1}+\mathrm{X}_{3} \leq$ 1 
B)  $\mathrm{X}_{1}+\mathrm{X}_{3} \geq$1 
C)  $X_{1}+X_{3}>$1 
D)  $X_{1}+X_{3}=$ 1

Question 20

A two-variable pure integer programming problem can only be solved by the simplex method.

Accepted Answer

A) True 
 B)False

A problem that has fixed cost as well as variable cost per unit, depending on the level of that activity, is usually formulated as a

An airport limousine service which parks all its limos at the airport can minimize its cost by using a proper order to pick up passengers from their houses and return to the airport using a

A vehicle routing problem is a special case of the well-known traveling salesman problem

For a typical integer programming problem, the number of feasible solutions

Set covering problem talks about a salesman and how he/she could cover a set of sales territories at minimal cost.

Problems in which some variables are required to be integers are called

A two-variable pure integer programming problem cannot be solved by the graphical method.

A retail outlet wants to replace a broken ice cream vending machine with one of two models. The purchase of model 1 is captured by variable X1. Taking a value of 1 and 0 would represent that machine 1 is not purchased. X2 is similarly defined. One of the constraints for this problem would be

A fixed charge problem models shops that incur a fixed cost for producing any positive quantity of a product and incur 0 cost if nothing is produced.

Problems with variables that are yes-no types are called

A common feature of set covering, knapsack, and location problems is that all of them use mixed integer programming formulation requiring no $0-1$ variables.

A two-variable pure integer programming problem can only be solved by the simplex method.

Introduction to Management Science, Modeling, and Excel Spreadsheets

Forecasting

Linear Programming: Basic Concepts and Graphical Solutions

Linear Programming: Applications and Solutions

Linear Programming: Sensitivity Analysis, Duality, and Specialized Models

Transportation, Assignment, and Transshipment Problems

Network Optimization Models

Nonlinear Optimization Models

Multi-Criteria Models

Decision Theory

Markov Analysis

Waiting Line Models

Simulation Cdrom Modules

Filters

Exam 7: Integer Programming

A problem that has fixed cost as well as variable cost per unit, depending on the level of that activity, is usually formulated as a

An airport limousine service which parks all its limos at the airport can minimize its cost by using a proper order to pick up passengers from their houses and return to the airport using a

A vehicle routing problem is a special case of the well-known traveling salesman problem

For a typical integer programming problem, the number of feasible solutions

Set covering problem talks about a salesman and how he/she could cover a set of sales territories at minimal cost.

Problems in which some variables are required to be integers are called

A two-variable pure integer programming problem cannot be solved by the graphical method.

A retail outlet wants to replace a broken ice cream vending machine with one of two models. The purchase of model 1 is captured by variable X1. Taking a value of 1 and 0 would represent that machine 1 is not purchased. X2 is similarly defined. One of the constraints for this problem would be

A fixed charge problem models shops that incur a fixed cost for producing any positive quantity of a product and incur 0 cost if nothing is produced.

Problems with variables that are yes-no types are called

A common feature of set covering, knapsack, and location problems is that all of them use mixed integer programming formulation requiring no 0−10-10−1 variables.

A two-variable pure integer programming problem can only be solved by the simplex method.

Introduction to Management Science, Modeling, and Excel Spreadsheets

Forecasting

Linear Programming: Basic Concepts and Graphical Solutions

Linear Programming: Applications and Solutions

Linear Programming: Sensitivity Analysis, Duality, and Specialized Models

Transportation, Assignment, and Transshipment Problems

Network Optimization Models

Nonlinear Optimization Models

Multi-Criteria Models

Decision Theory

Markov Analysis

Waiting Line Models

Simulation Cdrom Modules

Filters

A common feature of set covering, knapsack, and location problems is that all of them use mixed integer programming formulation requiring no $0-1$ variables.