Question 1

The objective function for an optimization problem is: Min 3x - 2y, with constraints x ≥ 0, y ≥ 0. x and y must be integers. Suppose that the integer restriction on the variables is removed. If so, this would be a familiar two-variable linear program; however, it would also be an example of

Accepted Answer

A) the convex hull of the linear program. 
B) a mixed-integer linear program. 
C) an LP relaxation of the integer linear program. 
D) a binary integer linear program.

Question 2

Which of the following approaches to solving integer linear optimization problems tries to identify the convex hull by adding a series of new constraints that do not exclude any feasible integer points?

Accepted Answer

A) Branch-and bound approach 
B) Cutting plane approach 
C) Trial-and-error approach 
D) Convex hull approach

Exam 13: Integer Linear Optimization Models

The objective function for an optimization problem is: Min 3x - 2y, with constraints x ≥ 0, y ≥ 0. x and y must be integers. Suppose that the integer restriction on the variables is removed. If so, this would be a familiar two-variable linear program; however, it would also be an example of

Which of the following approaches to solving integer linear optimization problems tries to identify the convex hull by adding a series of new constraints that do not exclude any feasible integer points?