Yes. Although possible in real life, it is unlikely in school examples!
Chat with our AI personalities
Yes. There need not be a feasible region.
Yes. If the feasible region has a [constraint] line that is parallel to the objective function.
Yes, but only if the solution must be integral. There is a segment of a straight line joining the two optimal solutions. Since the two solutions are in the feasible region part of that line must lie inside the convex simplex. Therefore any solution on the straight line joining the two optimal solutions would also be an optimal solution.
When solving linear prog. problems, we base our solutions on assumptions.one of these assumptions is that there is only one optimal solution to the problem.so in short NO. BY HADI It is possible to have more than one optimal solution point in a linear programming model. This may occur when the objective function has the same slope as one its binding constraints.
1. What do you understand by Linear Programming Problem? What are the requirements of Linear Programming Problem? What are the basic assumptions of Linear Programming Problem?