A feasible solution to an LP problem

Related MCQs

• A feasible solution to a linear programming problem
• The solution to a transportation problem with ‘m’ rows (supplies) & ‘n’ columns (destination) is feasible if number of positive allocations are
• Every basic feasible solution of a general assignment problem, having a square pay-off matrix of order, n should have assignments equal to
• For the basic feasible solution to remain optimal
• Consider the following linear programming problem: Maximize 12X + 10Y Subject to: 4X + 3Y ch7 <= 480 2X + 3Y ch7 <= 360 all variables >= 0 Which of the following points (X,Y) could be a feasible corner point?
• In linear programming problem if all constraints are less than or equal to, then the feasible region is
• The solution shown was obtained by Vogel's approximation. The difference between the objective function for this solution and that for the optimal is
• LP theory states that the optimal solution to any problem will lie at
• A solution that satisfies all the constraints of a linear programming problem except the nonnegativity constraints is called
• To find the optimal solution to a linear programming problem using the graphical method