The objective function for a linear optimization problem is: Max 3x + 2y, with one of the constraints being x and y both only take the values 0, 1. Also x and y are the only decision variables. This is an example of a
A)nonlinear program.
B)mixed-integer linear program.
C)LP relaxation of the integer linear program.
D)binary integer linear program.

Question

Quizplus · Accepted Answer

Since both x and y can only take the values 0 or 1 and are the only decision variables, this problem is a binary integer linear program. The objective function and constraints are linear, but the decision variables are restricted to binary values, fitting the definition of a binary integer linear program.

The Objective Function for a Linear Optimization Problem Is: Max