1. Math
  2. Statistics And Probability
  3. please let me know how to solve them...

Question: please let me know how to solve them...

Question details

1. If the objective is to minimize -2x +y, what is the pattern of the optimal solution(s)? a. Unique optimal solution b. Altemate optimal solutions C. No feasible solutions d. Unbounded optimal solution 2. If the objective is to maximize x, which two constraints are binding at optimal solution? a. Constraints 1 and 4 b. Constraints 4 and 5 C. Constraints 3 and 5 d None of the above 3. If the objective is to maximize x-y, does the LP problem have umbounded optimal solution? a. Yes b. No 4. Which of the following statements is correct? a. If Constraints 4 and 5 are removed, the feasible region still has six comer points. b. Removing anyone of the constraints 1, 2, 3, 4 and 5 will result in a larger feasible region. C. Adding a new constraint бх-7s-0 will make the feasible region bounded d. The point (5, 2) does not belong to the feasible region. 5. Which of the following is always true for linear programming problems? a. Removing a non-binding constraint can change optimal solution. b. Changing objective fimction can make a feasible problem have no feasible solutions. c. Adding a constraint will change optimal solution. d None of the above

please let me know how to solve them

Solution by an expert tutor
Blurred Solution
This question has been solved
Subscribe to see this solution