Jarvis is considering working on two short-term projects, one with a $5,000 profit and the other with a
$7,000 profit. Project 1 requires 7 days, and project 2 requires 11 days.
To formulate this problem, Jarvis needs to define some decision variables. A binary decision variable is
an integer decision variable that has been further restricted to just two values, 0 and 1. Jarvis will use two
binary decision variables, one for each project. A value of 1 means he decides to work on the project; a
value of 0 means he decides not to.
Jarvis develops the following problem formulation: