For the remaining questions, consider the following problem description: An oil company is considering exploring new well sites S1, S2, ..., S10 with respective costs C1, C2, C10. And in particular they want to find the least-cost selection of 5 out of the 10 possible sites. The binary decision variables x1, x2,..., X10 denote the decision to explore the corresponding site.

9.

a. Select the correct choice below and, if necessary, fill in the answer boxes to complete your choice. O A. The maximum value of the objective function z = 5x + 4y is ◻️and is located only at the point(s)◻️ (Type exact answers. Use a comma to separate answers as needed.) O B. The maximum value of the objective function z= 5x + 4y is.◻️It is located at the points◻️ and at all points on the line segment connecting them. (Type exact answers. Use a comma to separate answers as needed.) O C. The maximum does not exist. Select the correct choice below and, if necessary, fill in the answer boxes to complete your choice. O A. The minimum value of the objective function z = 5x + 4y is ?and is located only at the point(s)? (Type exact answers. Use a comma to separate answers as needed.) O B. The minimum value of the objective function Z= 5x + 4y is? (Type exact answers. Use a comma to separate answers as needed.) .It is located at the points ?and at all points on the line segment connecting…

At Long John Silver’s (LJS), Platter 1 comes with 2 pieces of fish, 3 pieces of chicken, and 5 fried shrimp, while Platter 2 comes with 3 pieces of fish, 1 piece of chicken, and 8 fried shrimp. Platter 1 sells for 8 dollars and platter 2 sells for 10 dollars. If LJS has access to 1000 pieces of fish, 1200 pieces of chicken, and 2600 fried shrimp, what is the optimal number of platters LJS should make in order to maximize its profit? Note that the constraints relate to (please use these in order) fish, chicken, and shrimp. Note that problem 7 had three constraints (excluding the non-negativity constraints), and setting two pairs of those constraints to equality led to two extreme points on the feasible region. What INFEASIBLE point was at the intersection of the other pair of constraints? In the optimal solution to problem 7, the optimum was found at the intersection of two of the constraints that were not non-negativity constraints. Call these “binding” constraints. One of those…