Science (English Medium) कक्षा १२ - CBSE Question Bank Solutions for Mathematics

The feasible region for an LPP is shown in the figure. Let F = 3x – 4y be the objective function. Maximum value of F is ______.

Refer to Question 30. Minimum value of F is ______.

Corner points of the feasible region for an LPP are (0, 2), (3, 0), (6, 0), (6, 8) and (0, 5). Let F = 4x + 6y be the objective function. The Minimum value of F occurs at  ______.

Refer to Question 32, Maximum of F – Minimum of F = ______.

In a LPP, the linear inequalities or restrictions on the variables are called ____________.

In a LPP, the objective function is always ______.

If the feasible region for a LPP is ______ then the optimal value of the objective function Z = ax + by may or may not exist.

In a LPP if the objective function Z = ax + by has the same maximum value on two corner points of the feasible region, then every point on the line segment joining these two points give the same ______ value.

A feasible region of a system of linear inequalities is said to be ______ if it can be enclosed within a circle.

A corner point of a feasible region is a point in the region which is the ______ of two boundary lines.

The feasible region for an LPP is always a ______ polygon.

If the feasible region for a LPP is unbounded, maximum or minimum of the objective function Z = ax + by may or may not exist.

Maximum value of the objective function Z = ax + by in a LPP always occurs at only one corner point of the feasible region.

In a LPP, the minimum value of the objective function Z = ax + by is always 0 if the origin is one of the corner point of the feasible region.

In a LPP, the maximum value of the objective function Z = ax + by is always finite.

Let A and B be two events such that P(A) = 0.6, P(B) = 0.2, and P(A|B) = 0.5. Then P(A′|B′) equals ______.

Two cards are drawn from a well-shuffled deck of 52 playing cards with replacement. The probability, that both cards are queens, is ______.

A relation R in set A = {1, 2, 3} is defined as R = {(1, 1), (1, 2), (2, 2), (3, 3)}. Which of the following ordered pair in R shall be removed to make it an equivalence relation in A?

Let the relation R in the set A = {x ∈ Z : 0 ≤ x ≤ 12}, given by R = {(a, b) : |a – b| is a multiple of 4}. Then [1], the equivalence class containing 1, is:

Based on the given shaded region as the feasible region in the graph, at which point(s) is the objective function Z = 3x + 9y maximum?