HSC Science (Computer Science) इयत्ता १२ वी - Maharashtra State Board Important Questions

 Maximize: z = 3x + 5y  Subject to

x +4y ≤ 24                3x + y  ≤ 21 

x + y ≤ 9                     x ≥ 0 , y ≥0

Find the feasible solution of the following inequation:

2x + 3y ≤ 6, x + y ≥ 2, x ≥ 0, y ≥ 0

The company makes concrete bricks made up of cement and sand. The weight of a concrete brick has to be at least 5 kg. Cement costs ₹ 20 per kg and sand costs of ₹ 6 per kg. Strength consideration dictates that a concrete brick should contain minimum 4 kg of cement and not more than 2 kg of sand. Form the L.P.P. for the cost to be minimum.

The maximum value of z = 5x + 3y subject to the constraints 3x + 5y ≤ 15, 5x + 2y ≤ 10, x, y ≥ 0 is ______.

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

4x - 18 ≥ 0

Solve the following LPP:

Minimize z = 4x + 2y

Subject to 3x + y ≥ 27, x + y ≥ 21, x + 2y ≥ 30, x ≥ 0, y ≥ 0

A firm manufactures two products A and B on which profit earned per unit are ₹ 3 and ₹ 4 respectively. Each product is processed on two machines M₁ and M₂. The product A requires one minute of processing time on M₁ and two minutes of processing time on M₂, B requires one minute of processing time on M₁ and one minute of processing time on M₂. Machine M₁ is available for use for 450 minutes while M₂ is available for 600 minutes during any working day. Find the number of units of products A and B to be manufactured to get the maximum profit.

Objective function of LPP is ______.

The feasible region is the set of point which satisfy.

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

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.

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

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.

If y=e^ax ,show that  `xdy/dx=ylogy`

If x^py^q = (x + y)^p+q then Prove that `dy/dx = y/x`

Find dy/dx if x sin y + y sin x = 0.