Question

1. What are the conditions causing linear programming problems to have multiple solutions?

Answer 1

The idea of multiple optimal solutions is related with the direct programming issues. The multiple optimal solutions will emerge in a straight program with more than one lot of essential solutions that can limit or expand the necessary target work. Now and then, the multiple optimal solutions are known as the elective essential arrangement.

If there should be an occurrence of a task issue, it is probably going to have two or extra approaches to expel a guaranteed number of zeros. This circumstance shows multiple optimal solutions with the indistinguishable optimal estimation of target work. Thusly, it very well may be said that the absolute expense or all out benefit will stay indistinguishable for various arrangements of designation in a task issue.

If there should be an occurrence of the simplex technique, the nearness of multiple optimal solutions is indicated by a condition under which a non-essential variable in the last simplex table shows the optimal answer for the issue and the net measure of commitment is zero.

The choice maker will utilize the most reasonable arrangement of the essential arrangement as the arrangement of the straight program when the issue has multiple optimal solutions.

The event of the multiple optimal solutions can't large issue on the grounds that the event of the elective solutions doesn't keep the specialist from finding one optimal answer for the issue.

The straight issue can be settled by utilizing the product like MS Excel, yet it just gives one optimal arrangement among numerous optimal solutions. Along these lines, it is sensible to take care of the issue physically for acquiring all the essential solutions when there is a chance of event of multiple optimal solutions.