मराठी

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

Advertisements
[object Object]
[object Object]
विषय
मुख्य विषय
अध्याय
Advertisements
Advertisements
Mathematics and Statistics
< prev  1401 to 1420 of 2353  next > 

State whether the following statement is True or False:

If the corner points of the feasible region are `(0, 7/3)`, (2, 1), (3, 0) and (0, 0), then the maximum value of Z = 4x + 5y is 12

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

State whether the following statement is True or False:

If the corner points of the feasible region are (0, 10), (2, 2) and (4, 0), then the minimum value of Z = 3x + 2y is at (4, 0)

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

Advertisements

State whether the following statement is True or False:

Corner point method is most suitable method for solving the LPP graphically

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

State whether the following statement is True or False:

Of all the points of feasible region, the optimal value is obtained at the boundary of the feasible region

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

State whether the following statement is True or False:

The point (6, 4) does not belong to the feasible region bounded by 8x + 5y ≤ 60, 4x + 5y ≤ 40, 0 ≤ x, y

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

State whether the following statement is True or False:

The graphical solution set of the inequations 0 ≤ y, x ≥ 0 lies in second quadrant

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

A set of values of variables satisfying all the constraints of LPP is known as ______

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

The feasible region represented by the inequations x ≥ 0, y ≤ 0 lies in ______ quadrant.

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

If the feasible region is bounded by the inequations 2x + 3y ≤ 12, 2x + y ≤ 8, 0 ≤ x, 0 ≤ y, then point (5, 4) is a ______ of the feasible region

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

A company manufactures 2 types of goods P and Q that requires copper and brass. Each unit of type P requires 2 grams of brass and 1 gram of copper while one unit of type Q requires 1 gram of brass and 2 grams of copper. The company has only 90 grams of brass and 80 grams of copper. Each unit of types P and Q brings profit of ₹ 400 and ₹ 500 respectively. Find the number of units of each type the company should produce to maximize its profit

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

A dealer deals in two products X and Y. He has ₹ 1,00,000/- to invest and space to store 80 pieces. Product X costs ₹ 2500/- and product Y costs ₹ 1000/- per unit. He can sell the items X and Y at respective profits of ₹ 300 and ₹ 90. Construct the LPP and find the number of units of each product to be purchased to maximize its profit

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

A company manufactures two types of ladies dresses C and D. The raw material and labour available per day is given in the table.

Resources Dress C(x) Dress D(y) Max. availability
Raw material 5 4 60
Labour 5 3 50

P is the profit, if P = 50x + 100y, solve this LPP to find x and y to get the maximum profit

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

Smita is a diet conscious house wife, wishes to ensure certain minimum intake of vitamins A, B and C for the family. The minimum daily needs of vitamins A, B, and C for the family are 30, 20, and 16 units respectively. For the supply of the minimum vitamin requirements Smita relies on 2 types of foods F1 and F2. F1 provides 7, 5 and 2 units of A, B, C vitamins per 10 grams and F2 provides 2, 4 and 8 units of A, B and C vitamins per 10 grams. F1 costs ₹ 3 and F2 costs ₹ 2 per 10 grams. How many grams of each F1 and F2 should buy every day to keep her food bill minimum

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

A chemist has a compound to be made using 3 basic elements X, Y, Z so that it has at least 10 litres of X, 12 litres of Y and 20 litres of Z. He makes this compound by mixing two compounds (I) and (II). Each unit compound (I) had 4 litres of X, 3 litres of Y. Each unit compound (II) had 1 litre of X, 2 litres of Y and 4 litres of Z. The unit costs of compounds (I) and (II) are ₹ 400 and ₹ 600 respectively. Find the number of units of each compound to be produced so as to minimize the cost

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

A wholesale dealer deals in two kinds of mixtures A and B of nuts. Each kg of mixture A contains 60 grams of almonds, 30 grams of cashew and 30 grams of hazel nuts. Each kg of mixture B contains 30 grams of almonds, 60 grams of cashew and 180 grams of hazel nuts. A dealer is contemplating to use mixtures A and B to make a bag which will contain at least 240 grams of almonds, 300 grams of cashew and 540 grams of hazel nuts. Mixture A costs ₹ 8 and B costs ₹ 12 per kg. How many kgs of each mixture should he use to minimize the cost of the kgs

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

Maximize Z = 2x + 3y subject to constraints

x + 4y ≤ 8, 3x + 2y ≤ 14, x ≥ 0, y ≥ 0.

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

Maximize Z = 5x + 10y subject to constraints

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

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

Maximize Z = 400x + 500y subject to constraints

x + 2y ≤ 80, 2x + y ≤ 90, x ≥ 0, y ≥ 0

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

Minimize Z = 24x + 40y subject to constraints

6x + 8y ≥ 96, 7x + 12y ≥ 168, x ≥ 0, y ≥ 0

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

Minimize Z = x + 4y subject to constraints

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

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

Englishहिंदीमराठी


      Forgot password?
Use app×