SCERT Maharashtra solutions for Mathematics and Statistics (Arts and Science) [English] 12 Standard HSC chapter 1.7 - Linear Programming Problems [Latest edition]

The corner points of the feasible solutions are (0, 0) (3, 0) (2, 1) (0, 7/3) the maximum value of Z = 4x + 5y is

The half plane represented by 4x + 3y >14 contains the point

The feasible region is the set of point which satisfy.

Objective function of LPP is ______.

The value of objective function is maximum under linear constraints

If a corner point of the feasible solutions are (0, 10) (2, 2) (4, 0) (3, 2) then the point of minimum Z = 3x + 2y is

The point of which the maximum value of z = x + y subject to constraints x + 2y ≤ 70, 2x + y ≤ 90, x ≥ 0, y ≥ 0 is obtained at

A solution set of the inequality x ≥ 0

Which value of x is in the solution set of inequality − 2X + Y ≥ 17

The graph of the inequality 3X − 4Y ≤ 12, X ≤ 1, X ≥ 0, Y ≥ 0 lies in fully in

Solve each of the following inequations graphically using XY-plane:

4x - 18 ≥ 0

Sketch the graph of inequation x ≥ 5y in xoy co-ordinate system

Find the graphical solution for the system of linear inequation 2x + y ≤ 2, x − y ≤ 1

Find the feasible solution of linear inequation 2x + 3y ≤ 12, 2x + y ≤ 8, x ≥ 0, y ≥ 0 by graphically

Solve graphically: x ≤ 0 and y ≥ 0

Find the solution set of inequalities 0 ≤ x ≤ 5, 0 ≤ 2y ≤ 7

Find the feasible solution of the following inequation:

3x + 2y ≤ 18, 2x + y ≤ 10, x ≥ 0, y ≥ 0

Draw the graph of inequalities x ≤ 6, y −2 ≤ 0, x ≥ 0, y ≥ 0 and indicate the feasible region

Check the ordered points (1, −1), (2, −1) is a solution of 2x + 3y − 6 ≤ 0

Show the solution set of inequations 4x – 5y ≤ 20 graphically

Maximize z = 5x + 2y subject to 3x + 5y ≤ 15, 5x + 2y ≤ 10, x ≥ 0, y ≥ 0

Maximize z = 7x + 11y subject to 3x + 5y ≤ 26, 5x + 3y ≤ 30, x ≥ 0, y ≥ 0

Maximize z = 10x + 25y subject to x + y ≤ 5, 0 ≤ x ≤ 3, 0 ≤ y ≤ 3

Solve the Linear Programming problem graphically:

Maximize z = 3x + 5y subject to x + 4y ≤ 24, 3x + y ≤ 21, x + y ≤ 9, x ≥ 0, y ≥ 0 also find the maximum value of z.

Solve the following LPP by graphical method:

Minimize z = 8x + 10y, subject to 2x + y ≥ 7, 2x + 3y ≥ 15, y ≥ 2, x ≥ 0, y ≥ 0.

Minimize z = 7x + y subjected to 5x + y ≥ 5, x + y ≥ 3, x ≥ 0, y ≥ 0

Minimize z = 6x + 21y subject to x + 2y ≥ 3, x + 4y ≥ 4, 3x + y ≥ 3, x ≥ 0, y ≥ 0 show that the minimum value of z occurs at more than two points

Minimize z = 2x + 4y is subjected to 2x + y ≥ 3, x + 2y ≥ 6, x ≥ 0, y ≥ 0 show that the minimum value of z occurs at more than two points

Maximize z = −x + 2y subjected to constraints x + y ≥ 5, x ≥ 3, x + 2y ≥ 6, y ≥ 0 is this LPP solvable? Justify your answer.

x − y ≤ 1, x − y ≥ 0, x ≥ 0, y ≥ 0 are the constant for the objective function z = x + y. It is solvable for finding optimum value of z? Justify?