In linear programming problem if all constraints are less than or equal to, then the feasible region is

Related MCQs

• Every Linear Programming Problem is related to another Linear Programming Problem, called ..........................
• If the feasible region of a linear programming problem is empty, the solution is ....................
• When at least one of the basic variables is zero, then the basic feasible solution to a Linear Programming Problem is said to be ..............................
• A feasible solution to a linear programming problem
• Most of the constraints in the linear programming problem are expressed as ……….
• In Linear Programming Problem, degeneracy occurs in ................. stages.
• All the parameters in the linear programming model are assumed to be .....................
• The solution to a transportation problem with ‘m’ rows and ‘n’ columns is feasible if the number of positive allocations are:
• Initial feasible solution to a transportation Problem can be found out by .........................
• Initial feasible solution to a transportation problem arrived through which of the following method is very near to the optimal solution: