Science (English Medium) इयत्ता १२ - CBSE Question Bank Solutions for Mathematics

Find the position vector of a point A in space such that `vec"OA"` is inclined at 60º to OX and at 45° to OY and `|vec"OA"|` = 10 units.

Maximise and Minimise Z = 3x – 4y subject to x – 2y ≤ 0, – 3x + y ≤ 4, x – y ≤ 6, x, y ≥ 0

Corner points of the feasible region determined by the system of linear constraints are (0, 3), (1, 1) and (3, 0). Let Z = px + qy, where p, q > 0. Condition on p and q so that the minimum of Z occurs at (3, 0) and (1, 1) is ______.

If A = [a_ij] is a square matrix of order 2 such that a_ij = `{(1","  "when i" ≠ "j"),(0","  "when"  "i" = "j"):},` then A² is ______.

For matrix A = `[(2,5),(-11,7)]` (adj A)' is equal to:

If y = log (cos e^x), then `"dy"/"dx"` is:

For A = `[(3,1),(-1,2)]`, then 14A⁻¹ is given by:

The maximum value of `["x"("x" − 1) + 1]^(1/3)`, 0 ≤ x ≤ 1 is:

A feasible region in the set of points which satisfy ____________.

Of all the points of the feasible region for maximum or minimum of objective function the points.

A set of values of decision variables which satisfies the linear constraints and nn-negativity conditions of an L.P.P. is called its ____________.

Z = 20x₁ + 20x₂, subject to x₁ ≥ 0, x₂ ≥ 0, x₁ + 2x₂ ≥ 8, 3x₁ + 2x₂ ≥ 15, 5x₁ + 2x₂ ≥ 20. The minimum value of Z occurs at ____________.

In linear programming feasible region (or solution region) for the problem is ____________.

Let R be the feasible region (convex polygon) for a linear programming problem and let Z = ax + by be the objective function. When Z has an optimal value (maximum or minimum), where the variables x and y are subject to constraints described by linear inequalities,

Let R be the feasible region for a linear programming problem, and let Z = ax + by be the objective function. If R is bounded, then ____________.

Let R be the feasible region for a linear programming problem, and let Z = ax + by be the objective function. If R is bounded, then the objective function Z has both a maximum and a minimum value on R and ____________.

In Corner point method for solving a linear programming problem the first step is to ____________.

In the Corner point method for solving a linear programming problem the second step after finding the feasible region of the linear programming problem and determining its corner points is ____________.

A feasible solution to a linear programming problem

The corner points of the bounded feasible region of a LPP are A(0,50), B(20, 40), C(50, 100) and D(0, 200) and the objective function is Z = x + 2y. Then the maximum value is ____________.