Question 1

Which of the following is not a type of integer programming model?

Accepted Answer

A)  An all-integer programming model 
B)  A mixed-integer programming model 
C)  A linear integer programming model 
D)  All of the above are types of integer programming models. 
A)  An all-integer programming model 
B)  A mixed-integer programming model 
C)  A linear integer programming model 
D)  All of the above are types of integer programming models. D

Question 2

Which of the following constraints belongs to an integer programming model but not necessarily to a linear programming model?

Accepted Answer

A)  Non-negativity constraints 
B)  Integer constraints 
C)  Non-integer constraints 
D)  All of the above 
A)  Non-negativity constraints 
B)  Integer constraints 
C)  Non-integer constraints 
D)  All of the above B

Question 3

The decision variables for the knapsack problem are defined as the number of items to be included in the knapsack from each of n potential items.

Accepted Answer

A) True 
 B)False  True

Question 4

Nonlinear integer programming models have the same structure as integer programming models.

Accepted Answer

A) True 
 B)False

Question 5

In the assignment model, the number of resources and tasks must always be equal.

Accepted Answer

A) True 
 B)False

Question 6

Non-negativity constraints belong to an integer programming model, but not necessarily to a linear programming model.

Accepted Answer

A) True 
 B)False

Question 7

The assignment method is a special case of an integer programming model.

Accepted Answer

A) True 
 B)False

Question 8

0-1 linear programming is a special case of:

Accepted Answer

A)  Integer programming. 
B)  Nonlinear programming. 
C)  Nonlinear integer programming. 
D)  All of the above 
A)  Integer programming. 
B)  Nonlinear programming. 
C)  Nonlinear integer programming. 
D)  All of the above

Question 9

Solver's evolutionary solving method is suggested for seeking optimal integer solutions for non-smooth integer models.

Accepted Answer

A) True 
 B)False

Question 10

The knapsack problem is a special case of integer programming models.

Accepted Answer

A) True 
 B)False

Question 11

Which of the following situations suggests that the decision maker impose binary values for decision variables?

Accepted Answer

A)  The decision maker wants to determine how many units of a product to produce. 
B)  The decision maker wants to determine whether or not to produce a production lot. 
C)  The decision maker wants to seek the minimum production cost. 
D)  All of the above 
A)  The decision maker wants to determine how many units of a product to produce. 
B)  The decision maker wants to determine whether or not to produce a production lot. 
C)  The decision maker wants to seek the minimum production cost. 
D)  All of the above

Question 12

Integer programming models have the same structure as:

Accepted Answer

A)  Linear programming. 
B)  Nonlinear programming. 
C)  Goal programming. 
D)  All of the above 
A)  Linear programming. 
B)  Nonlinear programming. 
C)  Goal programming. 
D)  All of the above

Question 13

While a regular linear programming model has an infinite number of possible solutions, the integer counterpart has:

Accepted Answer

A)  An infinite and identical set of possible solutions. 
B)  An infinite but different set of possible solutions. 
C)  A limited number of possible solutions. 
D)  All of the above are possible solution sets for the integer counterpart of a regular linear programming model. 
A)  An infinite and identical set of possible solutions. 
B)  An infinite but different set of possible solutions. 
C)  A limited number of possible solutions. 
D)  All of the above are possible solution sets for the integer counterpart of a regular linear programming model.

Question 14

Integer programming models have an objective function to be optimized, a set of constraints to be satisfied, and a set of constraints that forces some or all decision variables to be integers.

Accepted Answer

A) True 
 B)False

Question 15

The divisibility assumption in the mathematical programming model is an acceptable and often reasonable assumption in many applications.

Accepted Answer

A) True 
 B)False

Question 16

Nonlinear integer programming models offer additional challenges for solution algorithms because the values of reduced gradients are valid only at the point of the optimal solution.

Accepted Answer

A) True 
 B)False

Question 17

Adding integer constraints to regular linear programming models significantly changes the problem.

Accepted Answer

A) True 
 B)False

Question 18

The number of decision variables in the assignment problem does not change significantly when the number of resources or tasks increases.

Accepted Answer

A) True 
 B)False

Question 19

Which of the following is a context that may require the use of the knapsack problem?

Accepted Answer

A)  Selecting a project from a given list in which each project is characterized by its own budget and return on investment 
B)  Selecting items from a list of products to be shipped, considering that each item has a volume and revenue 
C)  Both a and b 
D)  Neither a nor b 
A)  Selecting a project from a given list in which each project is characterized by its own budget and return on investment 
B)  Selecting items from a list of products to be shipped, considering that each item has a volume and revenue 
C)  Both a and b 
D)  Neither a nor b

Question 20

Searching for the optimal integer solution becomes easier for non-smooth nonlinear models.

Accepted Answer

A) True 
 B)False

Which of the following is not a type of integer programming model?

Which of the following constraints belongs to an integer programming model but not necessarily to a linear programming model?

The decision variables for the knapsack problem are defined as the number of items to be included in the knapsack from each of n potential items.

Nonlinear integer programming models have the same structure as integer programming models.

In the assignment model, the number of resources and tasks must always be equal.

Non-negativity constraints belong to an integer programming model, but not necessarily to a linear programming model.

The assignment method is a special case of an integer programming model.

0-1 linear programming is a special case of:

Solver's evolutionary solving method is suggested for seeking optimal integer solutions for non-smooth integer models.

The knapsack problem is a special case of integer programming models.

Which of the following situations suggests that the decision maker impose binary values for decision variables?

Integer programming models have the same structure as:

While a regular linear programming model has an infinite number of possible solutions, the integer counterpart has:

Integer programming models have an objective function to be optimized, a set of constraints to be satisfied, and a set of constraints that forces some or all decision variables to be integers.

The divisibility assumption in the mathematical programming model is an acceptable and often reasonable assumption in many applications.

Nonlinear integer programming models offer additional challenges for solution algorithms because the values of reduced gradients are valid only at the point of the optimal solution.

Adding integer constraints to regular linear programming models significantly changes the problem.

The number of decision variables in the assignment problem does not change significantly when the number of resources or tasks increases.

Which of the following is a context that may require the use of the knapsack problem?

Searching for the optimal integer solution becomes easier for non-smooth nonlinear models.

Business Analytics With Management Science

Introduction to Linear Programming

Business Analytics With Linear Programming

Business Analytics With Nonlinear Programming

Business Analytics With Goal Programming

Business Analytics With Shipment Models

Marketing Analytics With Linear Programming

Marketing Analytics With Multiple Goals

Business Analytics With Simulation

Filters

Exam 6: Business Analytics With Integer Programming

Which of the following is not a type of integer programming model?

Which of the following constraints belongs to an integer programming model but not necessarily to a linear programming model?

The decision variables for the knapsack problem are defined as the number of items to be included in the knapsack from each of n potential items.

Nonlinear integer programming models have the same structure as integer programming models.

In the assignment model, the number of resources and tasks must always be equal.

Non-negativity constraints belong to an integer programming model, but not necessarily to a linear programming model.

The assignment method is a special case of an integer programming model.

0-1 linear programming is a special case of:

Solver's evolutionary solving method is suggested for seeking optimal integer solutions for non-smooth integer models.

The knapsack problem is a special case of integer programming models.

Which of the following situations suggests that the decision maker impose binary values for decision variables?

Integer programming models have the same structure as:

While a regular linear programming model has an infinite number of possible solutions, the integer counterpart has:

Integer programming models have an objective function to be optimized, a set of constraints to be satisfied, and a set of constraints that forces some or all decision variables to be integers.

The divisibility assumption in the mathematical programming model is an acceptable and often reasonable assumption in many applications.

Nonlinear integer programming models offer additional challenges for solution algorithms because the values of reduced gradients are valid only at the point of the optimal solution.

Adding integer constraints to regular linear programming models significantly changes the problem.

The number of decision variables in the assignment problem does not change significantly when the number of resources or tasks increases.

Which of the following is a context that may require the use of the knapsack problem?

Searching for the optimal integer solution becomes easier for non-smooth nonlinear models.

Business Analytics With Management Science

Introduction to Linear Programming

Business Analytics With Linear Programming

Business Analytics With Nonlinear Programming

Business Analytics With Goal Programming

Business Analytics With Shipment Models

Marketing Analytics With Linear Programming

Marketing Analytics With Multiple Goals

Business Analytics With Simulation

Filters