🎴 Flashcard Mode
Integer Programming: Formulations and Algorithms
Card1 / 14
Mastered0
Review0
QuestionClick to flip
Which of the following is a valid formulation for an Integer Programming problem?
AnswerClick to flip back
A
Maximize z = 2x + 3y subject to x, y ∈ Z
💡 Explanation:
In Integer Programming, the decision variables are restricted to integer values. Therefore, a valid formulation includes the constraint x, y ∈ Z, which ensures that the variables take on integer values.