Suppose we are deciding which projects to implement in the upcoming year. Let's represent each project using a binary variable so that whether or not we do project 1 is represented by P1, Project 2 is represented by P2, and so on. The managers decide that to complete Project 2, Project 1 must be finished first but Project 3 CANNOT be done. Which pair of constraints capture this requirement? O P2 <= P1 and P2 <=P3 O P2 <= P1 and P2 >= P3 O P2 <= P1 and P2 +P3 <=1 O P2 >= P1 and P2 +P3 <=1 O P2 = P1 and P2 +P3 <=1

Suppose we are deciding which projects to implement in the upcoming year. Let's represent each project using a binary variable so that whether or not we do project 1 is represented by P1, Project 2 is represented by P2, and so on. The managers decide that to complete Project 2, Project 1 must be finished first but Project 3 CANNOT be done. Which pair of constraints capture this requirement? O P2 <= P1 and P2 <=P3 O P2 <= P1 and P2 >= P3 O P2 <= P1 and P2 +P3 <=1 O P2 >= P1 and P2 +P3 <=1 O P2 = P1 and P2 +P3 <=1

Practical Management Science

6th Edition

ISBN:9781337406659

Author:WINSTON, Wayne L.

Publisher:WINSTON, Wayne L.

Chapter6: Optimization Models With Integer Variables

Section: Chapter Questions

Problem 40P

See similar textbooks