English

HSC Commerce (English Medium) 12th Standard Board Exam - Maharashtra State Board Question Bank Solutions for Mathematics and Statistics

Advertisements
[object Object]
[object Object]
Subjects
Popular subjects
Topics
Advertisements
Advertisements
Mathematics and Statistics
< prev  1241 to 1260 of 2353  next > 

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.

[14] Linear Programming
Chapter: [14] Linear Programming
Concept: undefined >> undefined

Choose the correct alternative:

The value of objective function is maximize under linear constraints.

[14] Linear Programming
Chapter: [14] Linear Programming
Concept: undefined >> undefined

Advertisements

Choose the correct alternative :

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

[14] Linear Programming
Chapter: [14] Linear Programming
Concept: undefined >> undefined

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.

[14] Linear Programming
Chapter: [14] Linear Programming
Concept: undefined >> undefined

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

[14] Linear Programming
Chapter: [14] Linear Programming
Concept: undefined >> undefined

Fill in the blank :

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

[14] Linear Programming
Chapter: [14] Linear Programming
Concept: undefined >> undefined

Fill in the blank :

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

[14] Linear Programming
Chapter: [14] Linear Programming
Concept: undefined >> undefined

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

[14] Linear Programming
Chapter: [14] Linear Programming
Concept: undefined >> undefined

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

[14] Linear Programming
Chapter: [14] Linear Programming
Concept: undefined >> undefined

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

[14] Linear Programming
Chapter: [14] Linear Programming
Concept: undefined >> undefined

State whether the following is True or False :

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

[14] Linear Programming
Chapter: [14] Linear Programming
Concept: undefined >> undefined

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

[14] Linear Programming
Chapter: [14] Linear Programming
Concept: undefined >> undefined

Solve the following problem :

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

[14] Linear Programming
Chapter: [14] Linear Programming
Concept: undefined >> undefined

Solve the following problem :

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

[14] Linear Programming
Chapter: [14] Linear Programming
Concept: undefined >> undefined

Solve the following problem :

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

[14] Linear Programming
Chapter: [14] Linear Programming
Concept: undefined >> undefined

Solve the following problem:

Maximize Z = 4x1 + 3x2 Subject to 3x1 + x2 ≤ 15, 3x1 + 4x2 ≤ 24, x1 ≥ 0, x2 ≥ 0

[14] Linear Programming
Chapter: [14] Linear Programming
Concept: undefined >> undefined

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

[14] Linear Programming
Chapter: [14] Linear Programming
Concept: undefined >> undefined

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.

Product/Machines Chair
(x)
Table
(y)
Available time (hours)
Assembling 3 3 36
Finishing 5 2 50
Polishing 2 6 60

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

[14] Linear Programming
Chapter: [14] Linear Programming
Concept: undefined >> undefined

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.

[14] Linear Programming
Chapter: [14] Linear Programming
Concept: undefined >> undefined

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.

Ingredients per kg. /Chemical Units A
(x)
B
(y)
Minimum requirements in
P 1 2 80
Q 3 1 75
Cost (in ₹) 4 6  

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

[14] Linear Programming
Chapter: [14] Linear Programming
Concept: undefined >> undefined
< prev  1241 to 1260 of 2353  next > 
Advertisements
Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×