Why do you choose the corner points of a feasible region as the candidates for finding optimal solution?

If we are working with a system that has three constraints such that our feasible space is inside this triangle. Then we land on a corner point and we can’t go any farther. This must be the best we can do in this direction. Then we reason, that we only need to check the other corners of our feasible space.

How do you find the optimal solution of an LP problem?

We determine the optimal solution to the LP by plotting (180x + 160y) = K (K constant) for varying K values (iso-profit lines). One such line (180x + 160y = 180) is shown dotted on the diagram.

What is infeasible region?

A problem is said to be infeasible if no solution exists which satisfies all the constraints. In this case the feasible region defined by the intersecting constraints is empty.

What are requirements of linear programming?

Requirement of Linear Programme Problem (L.P.P) | Operations Research

• (1) Decision Variable and their Relationship:
• (2) Well-Defined Objective Function:
• (3) Presence of Constraints or Restrictions:
• (4) Alternative Courses of Action:
• (5) Non-Negative Restriction:

What are the basic requirements for linear programming?

All linear programming problems must have following five characteristics:

• (a) Objective function:
• (b) Constraints:
• (c) Non-negativity:
• (d) Linearity:
• (e) Finiteness:

What does it mean to have a feasible region in the form of shaded region as the solution set in solving systems of linear inequalities?

Systems of inequalities may be solved graphically by plotting each line along with the shaded half space of the inequality. The area of intersection will then be the feasible region which will bet the solution set of the system.

Is Modi method and UV method same?

The modified distribution method, is also known as MODI method or (u – v) method provides a minimum cost solution to the transportation problems. MODI method is an improvement over stepping stone method.

What is optimal solution and feasible solution?

A feasible solution satisfies all the problem’s constraints. An optimal solution is a feasible solution that results in the largest possible objective function value when maximizing (or smallest when minimizing). A graphical solution method can be used to solve a linear program with two variables.

Which method gives optimal solution to transportation problem?

VAM is the best solution method but degeneracy is a major issue in transportation problem. In a standard transportation problem with m sources of supply and n demand , any feasible solution requires allocations in m + n – 1 independent cells.