HSC Commerce (English Medium) इयत्ता १२ वी - Maharashtra State Board Question Bank Solutions for Mathematics and Statistics

Solve the following L.P.P. by graphical method:

Minimize: Z = 6x + 2y subject to x + 2y ≥ 3, x + 4y ≥ 4, 3x + y ≥ 3, x ≥ 0, y ≥ 0.

Choose the correct alternative:

The value of objective function is maximize under linear constraints.

Choose the correct alternative :

The maximum value of z = 5x + 3y. subject to the constraints

Choose the correct alternative :

The maximum value of z = 10x + 6y, subjected to the constraints 3x + y ≤ 12, 2x + 5y ≤ 34, x ≥ 0, y ≥ 0 is.

Choose the correct alternative :

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

Fill in the blank :

Graphical solution set of the in equations x ≥ 0, y ≥ 0 is in _______ quadrant

Fill in the blank :

The region represented by the in equations x ≤ 0, y ≤ 0 lines in _______ quadrants.

The region represented by the inequality y ≤ 0 lies in _______ quadrants.

The constraint that a factory has to employ more women (y) than men (x) is given by _______

The region represented by the inequalities x ≥ 0, y ≥ 0 lies in first quadrant.

State whether the following is True or False :

The region represented by the inqualities x ≤ 0, y ≤ 0 lies in first quadrant.

Graphical solution set of x ≤ 0, y ≥ 0 in xy system lies in second quadrant.

Solve the following problem :

Maximize Z = 5x₁ + 6x₂ Subject to 2x₁ + 3x₂ ≤ 18, 2x₁ + x₂ ≤ 12, x ≥ 0, x₂ ≥ 0

Solve the following problem :

Minimize Z = 4x + 2y Subject to 3x + y ≥ 27, x + y ≥ 21, x ≥ 0, y ≥ 0

Solve the following problem :

Minimize Z = 2x + 3y Subject to x – y ≤ 1, x + y ≥ 3, x ≥ 0, y ≥ 0

Solve the following problem:

Maximize Z = 4x₁ + 3x₂ Subject to 3x₁ + x₂ ≤ 15, 3x₁ + 4x₂ ≤ 24, x₁ ≥ 0, x₂ ≥ 0

Maximize Z = 60x + 50y Subject to x + 2y ≤ 40, 3x + 2y ≤ 60, x ≥ 0, y ≥ 0

A carpenter makes chairs and tables, profits are ₹ 140 per chair and ₹ 210 per table. Both products are processed on three machines, Assembling, Finishing and Polishing. The time required for each product in hours and the availability of each machine is given by the following table.

Formulate and solve the following Linear programming problems using graphical method.

Solve the following problem :

A company manufactures bicyles and tricycles, each of which must be processed through two machines A and B Maximum availability of machine A and B is respectively 120 and 180 hours. Manufacturing a bicycle requires 6 hours on machine A and 3 hours on machine B. Manufacturing a tricycle requires 4 hours on machine A and 10 hours on machine B. If profits are ₹ 180 for a bicycle and ₹ 220 on a tricycle, determine the number of bicycles and tricycles that should be manufacturing in order to maximize the profit.

Solve the following problem :

A factory produced two types of chemicals A and B The following table gives the units of ingredients P & Q (per kg) of Chemicals A and B as well as minimum requirements of P and Q and also cost per kg. of chemicals A and B.

Find the number of units of chemicals A and B should be produced so as to minimize the cost.