Integer Programming: Formulations and Algorithms

Casual Mode - Take your time!

1 / 14
✓
Correct
0
✗
Incorrect
0
★
Score
0%
Multiple Choice

Which of the following is a valid formulation for an Integer Programming problem?

  1. Minimize z = 2x + 3y
  2. Maximize z = 2x + 3y subject to x, y ≥ 0
  3. Maximize z = 2x + 3y subject to x, y ∈ Z
  4. Minimize z = 2x + 3y subject to x, y ∈ R
Change Mode