Linear Programm...

If the system of constraints has no point which satisfies all the constraints and non-negativity restrictions then the solution of a LPP is an ​

The optimum value of the objective function is attained at the points ​

The maximum value of Z = 4x + 3y subjected to the constraints 3x + 2y ≤160, 5x + 2y ≤200, x + 2y ≤80 ;
x, y ≥0 attains at ​

A feasible solution of a LPP if it also optimizes the objective function is called ​

Shape of the feasible region formed by the following constraints is x + y ≤10, x + y ≥6, x ≥0, y ≥0 ​

Region represented by x ≥0, y ≥0 is ​

Find the maximum value of z = 3x + 4y subject to constraints x + y ≤4 , x ≥0 and y ≥0 ​

Infeasibility means that the number of solutions to the linear programming models that satisfies all constraints is ​

The set of all feasible solutions of a LPP is a ____ set.​

Which of the following sets are convex ?​