An n-tuple of real numbers which satisfies the constraints of Linear Programming Problem is called ___________

Related MCQs

• If primal linear programming problem has a finite solution, then dual linear programming problem should have____________.
• Any solution to a Linear Programming Problem which also satisfies the non- negative notifications of the problem has _________.
• If all the constraints of the primal problem in equations are of type less than or equal to then the constraints in the dual problem is ___________.
• If the primal problem has n constraints and m variables then the number of constraints in the dual problem is __________.
• If the constraints of an Linear Programming Problem has an in equation of greater than or equal to type, the variable to be added to are ___________
• A feasible solution of an Linear Programming Problem that optimizes then the objective function is called _________
• In an Linear Programming Problem functions to be maximized or minimized are called ___________.
• The method used to solve Linear Programming Problem without use of the artificial variable is called __________.
• Solution of a Linear Programming Problem when permitted to be infinitely large is called _________.
• Mathematical model of linear programming problem is important because______.