Exam 6: Business Analytics With Integer Programming

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.

In order to strictly enforce integer values for the final solution, the decision maker must set the tolerance level for integer constraints to zero.

In the assignment method, the decision maker seeks to assign each available resource to a specific task.

The objective function of the assignment method always seeks to minimize cost.

When determining the number of pounds of lumber to be produced, decision variables must be enforced as integer values.

The finite nature of integer programming models leads to simpler solution algorithms.

While a regular linear programming model has an infinite number of possible solutions, the integer counterpart has an infinite but different set of possible solutions.

Which of the following is a result that the decision maker should anticipate when solving an integer linear programming model with a maximization objective?

The objective function of the assignment method in business settings always seeks to maximize revenue, profit, or another organizational metric.

The knapsack problem is a special case of the binary linear programming model.

In the assignment method, the decision maker seeks to assign:

Which of the following is a result that the decision maker should anticipate when solving an integer nonlinear programming model with a maximization objective?

Which of the following is a result that the decision maker should anticipate when solving an integer nonlinear programming model with a minimization objective?

In a mathematical programming model, the divisibility assumption allows decision variables to take:

The impact of rounding a fractional solution into an integer solution on the objective function is always minimal.

Nonlinear integer programming models offer additional challenges for solution algorithms because:

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

Which of the following is a context that may require the use of the assignment method?

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

Which of the following is a result that the decision maker should anticipate when solving an integer linear programming model with a minimization objective?