Test: Introduction To Linear Programming


10 Questions MCQ Test Mathematics (Maths) Class 12 | Test: Introduction To Linear Programming


Description
This mock test of Test: Introduction To Linear Programming for JEE helps you for every JEE entrance exam. This contains 10 Multiple Choice Questions for JEE Test: Introduction To Linear Programming (mcq) to study with solutions a complete question bank. The solved questions answers in this Test: Introduction To Linear Programming quiz give you a good mix of easy questions and tough questions. JEE students definitely take this Test: Introduction To Linear Programming exercise for a better result in the exam. You can find other Test: Introduction To Linear Programming extra questions, long questions & short questions for JEE on EduRev as well by searching above.
QUESTION: 1

Problems which seek to maximise or, minimise profit or, cost form a general class of problems called ………​

Solution:

In any problem in which we maximise or minimise profit or cost i.e. we find the     optimal value.Hence, they are called Optimisation Problems

QUESTION: 2

A ……… of a feasible region is a point in the region, which is the intersection of two boundary lines.​

Solution:

A vertex of the feasible region. Not every intersection of lines is a corner point. The corner points only occur at a vertex of the feasible region. If there is going to be an optimal solution to a linear programming problem, it will occur at one or more corner points, or on a line segment between two corner points.

QUESTION: 3

The linear inequalities or equations or restrictions on the variables of a linear programming problem are called …… The conditions x ≥ 0 , y ≥ 0 are called …….​

Solution:
QUESTION: 4

The common region determined by all the constraints including non-negative constraints x, y ≥ 0 of a linear programming problem is called the ………​

Solution:
QUESTION: 5

Let Z = ax + by is a linear objective function. Variables x and y are called ……… variables.​

Solution:
QUESTION: 6

A linear function of several variables x and y is called ………​

Solution:
QUESTION: 7

Every point of feasible region is called a ……… to the problem.​

Solution:
QUESTION: 8

How many of the following points satisfy the inequality 2x – 3y > -5?
(1, 1), (-1, 1), (1, -1), (-1, -1), (-2, 1), (2, -1), (-1, 2) and (-2, -1)​

Solution:

2x – 3y > -5
Only these 5 (x, y) pairs satisfy the inequality 
(1, 1), (1, -1), (-1, -1), (2, -1), (-2, -1)

QUESTION: 9

The linear inequalities on the variables of a linear programming problem are called ………​

Solution:
QUESTION: 10

The feasible solution of a L.P.P. belongs to​

Solution:

As per the definition of LPP:
Linear Programming Problem is one that is concerned with finding the optimal value of a linear function of several variables, subject to the conditions that the variables are non-negative and satisfy a set of linear inequalities.
Since the variables (x & y) are non-negative, the feasible solution of a LPP belongs to the 1st quadrant only.