4 Handout C. (This is 1 page). Problem setup. (You can think about the current presidential election and how the two candidate think about spending monedy). The campaign manager for a candidate is considering which states to visit during the last week of a campaign leading up to the nationwide election. The goal of the candidate is to carn as many voters as possible. The candidate will visit following five states on last time to gain supporters: Pennsylvania (P), Wisconsin (W), Florida (F), New York (Y), and North Carolina (C). (Note, capital letters are being used here instead of xj. This notation has no impact on setting up the problem.) The candidate is constrained and has only 80 hours and $250 million left in her campaign fund. A visit to Pennsylvania takes 10 hours and costs $15 million but earns 1% of the electorate. A visit to Wisconsin takes 15 hours and costs $20 million and earns 1.5%; a visit to Florida is only $8 million but takes 16 hours and earns 2%, and a visit to New York costs $25 million, requires 2 hours and earns 2% of the electorate. North Carolina requires 18 hours and $22 million per trip but earns 3% of the electorate. Refer to the Handout C found on Canvas. (Handout C is one page). What is the time constraint? O P + 1.5W + 2F + 2Y + 3C s 80 O P + 1.5W + 2F + 2Y + 3C s 250 10P + 15W + 16F + 2Y+ 18C s 80 15P +20W +8F +257 +22C s 80 Refer to the Handout C found on Canvas. (Handout C is one page). What is the objective function? O MAX Z = P + 1.5W + 2F + 2Y + 3C O MAX Z = 10P + 15W + 16F + 2y + 18C MIN TC = 10P + 15W + 16F + 27 + 18C MIN TC = 15P+ 20W +8F +25Y+22C Refer to the Handout C found on Canvas. (Handout C is one page). What is the financial constraint? O 15P+20W+8F+25Y+22C s 80 10P+15W+16F+2Y+18C s 250 O P+1.5W+2F+2Y+3C s 250 O 15P+20W+8F+25Y+22C s 250