QUIZ

Linear Programming Problem is a technique of finding the ______________.

___ is a mathematical technique used to solve the problem of allocating limited resource among the competing activities

Graphical optimal value for Z can be obtained from

Feasible solution satisfies __________

Solution of a Linear Programming Problem when permitted to be infinitely large is called ______________.

A Linear Programming Problem have ______________ optimal solution

The objective function and constraints are functions of two types of variables, _____ variables and _________ variables.

Graphical method is also known as ______________.

The area bounded by all the given constraints is called ______________.

The slack variables indicate ______________.

Operations Research approach is ______________.

Identify the type of the feasible region given by the set of inequalities x-y<=1 x-y>=2 where both x and y are positive.

All equality constraints can be replaced equivalently by ______________ inequalities

A feasible solution to a linear programming problem ______________.

Graphical method of linear programming is useful when the number of decision variable are ______________.

A feasible solution of an Linear Programming Problem that optimizes the objective function is called ______________

Linear Programming Problem that can be solved by graphical method has ______________.

Operation research approach is typically based on the use of ______________.

In an Linear Programming Problem functions to be maximized or minimized are called ______________.

The region common to all the constraints including the non-negativity restrictions is called the ______________.

Any solution to a Linear Programming Problem which also satisfies the non- negative notifications of the problem has __.

While solving a linear programming problem infeasibility may be removed by ______________.

Mathematical model of linear programming problem is important because _______.