Question

In graphical method of linear programming
problem if the los-cost line coincide with a
side of region of basic feasible solutions we
get​

Answer 1

Answer:

Graphical Method: Owing to the importance of linear programming models in various industries, many types of algorithms have been developed over the years to solve them. Some famous mentions include the Simplex method, the Hungarian approach, and others. Here we are going to concentrate on one of the most basic methods to handle a linear programming problem i.e. the graphical method.

In principle, this method works for almost all different types of problems but gets more and more difficult to solve when the number of decision variables and the constraints increases. Therefore, we’ll illustrate it in a simple case i.e. for two variables only.

Answer 2

Infinite number of optimum solutions

In graphical method of linear programming problem if the loss-cost line coincide with a side of region of basic feasible solutions we get​ Infinite number of optimum solutions.

• Finding the highest or lowest point of the intersection on a graph between the goal function line and the feasible region allows us to solve the issues using a graphical approach of linear programming.
• The area of the graph that contains every point that satisfies every inequality in a system is known as the feasible region. First, graph each inequality in the system before drawing the reachable region. Next, locate the region where all the graphs meet. That area is reachable.
• A setup of the variables provides a solution to a linear programme. A viable solution to a linear programme is one that satisfies every restriction. The collection of all potential feasible solutions is referred to as the feasible zone in a linear programme.
• The zero vector is the only fundamentally viable solution. The convex combination of BFS must be bounded, although a viable region may be unbounded. Unless the linear programme has a bounded viable region, the statement is untrue.

#SPJ2