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

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.

If `[(2"a"+"b", "a"-2"b"),(5"c" - "d", 4"c"+3"d")] = [(4, -3),(11, 24)]`, then value of a + b – c + 2d 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?

The least value of the function f(x) = 2 cos x + x in the closed interval `[0, π/2]` is:

In the given graph, the feasible region for an LPP is shaded. The objective function Z = 2x – 3y will be minimum at:

If A = `[(1,-1,0),(2,3,4),(0,1,2)]` and B = `[(2,2,-4),(-4,2,-4),(2,-1,5)]`, then:

A linear programming problem is as follows:

Minimize Z = 30x + 50y

Subject to the constraints: 3x + 5y ≥ 15, 2x + 3y ≤ 18, x ≥ 0, y ≥ 0

In the feasible region, the minimum value of Z occurs at:

For an objective function Z = ax + by, where a, b > 0; the corner points of the feasible region determined by a set of constraints (linear inequalities) are (0, 20), (10, 10), (30, 30) and (0, 40). The condition on a and b such that the maximum Z occurs at both the points (30, 30) and (0, 40) is:

In a linear programming problem, the constraints on the decision variables x and y are x − 3y ≥ 0, y ≥ 0, 0 ≤ x ≤ 3. The feasible region:

Let A = `[(1,sin α,1),(-sin α,1,sin α),(-1,-sin α,1)]`, where 0 ≤ α ≤ 2π, then:

Objective function of a linear programming problem is ____________.

The maximum value of the object function Z = 5x + 10 y subject to the constraints x + 2y ≤ 120, x + y ≥ 60, x - 2y ≥ 0, x ≥ 0, y ≥ 0 is ____________.

Z = 7x + y, subject to 5x + y ≥ 5, x + y ≥ 3, x ≥ 0, y ≥ 0. The minimum value of Z occurs at ____________.

A linear programming problem is one that is concerned with ____________.

In linear programming infeasible solutions

In linear programming, optimal solution ____________.

A maximum or a minimum may not exist for a linear programming problem if ____________.

In Corner point method for solving a linear programming problem, one finds the feasible region of the linear programming problem, determines its corner points, and evaluates the objective function Z = ax + by at each corner point. If M and m respectively be the largest and smallest values at corner points then ____________.