JEE Main Linear Programming — practice questions
17 free MCQs with worked solutions. Tap any question for the answer + explanation, or practice them all in the app.
Practice JEE Main Linear Programming in the app →In a linear programming problem, the linear function $Z = ax + by$ to be optimised is called the:The common region determined by all the constraints of an LPP is called the:By the corner point theorem, the optimal value of the objective function of an LPP occurs at:The conditions $x \ge 0,\ y \ge 0$ in an LPP are called the:A feasible region that extends indefinitely in some direction is said to be:If the feasible region of an LPP is bounded, then the objective function $Z$ has:Maximise $Z = 3x + 2y$ over the corner points $(0,0),\ (4,0),\ (0,5),\ (2,3)$. The maximum value is:Minimise $Z = x + y$ over the corner points $(5,0),\ (0,4),\ (1,1)$. The minimum value is:In an LPP, the decision variables are required to be:The graph of a linear inequality such as $2x + 3y \le 12$ represents:The corner points of a feasible region are obtained as the:If the feasible region of an LPP is empty, then the problem has:The word 'linear' in linear programming indicates that the objective function and constraints are:In a linear programming problem, the objective function is:By the corner-point theorem, the optimum of a bounded LPP occurs:The non-negativity constraints in an LPP typically include:A linear program has an unbounded feasible region. The maximisation of the objective function: