मराठी

HSC Science (Electronics) इयत्ता १२ वी - Maharashtra State Board Question Bank Solutions

Advertisements
विषय
अध्याय
विषय
मुख्य विषय
अध्याय

Please select a subject first

Advertisements
Advertisements
< prev  6661 to 6680 of 10390  next > 

A company manufactures two types of chemicals Aand B. Each chemical requires two types of raw material P and Q. The table below shows number of units of P and Q required to manufacture one unit of A and one unit of B and the total availability of P and Q.

Chemical→ A B Availability
Raw Material ↓
P 3 2 120
Q 2 5 160

The company gets profits of ₹ 350 and ₹ 400 by selling one unit of A and one unit of B respectively. (Assume that the entire production of A and B can be sold). How many units of the chemicals A and B should be manufactured so that the company gets a maximum profit? Formulate the problem as LPP to maximize profit.

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

A printing company prints two types of magazines A and B. The company earns ₹ 10 and ₹ 15 in magazines A and B per copy. These are processed on three Machines I, II, III. Magazine A requires 2 hours on Machine I, 5 hours on Machine II, and 2 hours on machine III. Magazine B requires 3 hours on machine I, 2 hours on machine II and 6 hours on Machine III. Machines I, II, III are available for 36, 50, and 60 hours per week respectively. Formulate the LPP to determine weekly production of magazines A and B, so that the total profit is maximum.

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

Advertisements

A manufacturer produces bulbs and tubes. Each of these must be processed through two machines M1 and M2. A package of bulbs requires 1 hour of work on Machine M1 and 3 hours of work on Machine M2. A package of tubes requires 2 hours on Machine M1 and 4 hours on Machine M2. He earns a profit of ₹ 13.5 per package of bulbs and ₹ 55 per package of tubes. Formulate the LPP to maximize the profit, if he operates the machine M1, for almost 10 hours a day and machine M2 for almost 12 hours a day.

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

A company manufactures two types of fertilizers F1 and F2. Each type of fertilizer requires two raw materials A and B. The number of units of A and B required to manufacture one unit of fertilizer F1 and F2 and availability of the raw materials A and B per day are given in the table below:

Fertilizers→ F1 F2 Availability
Raw Material ↓
A 2 3 40
B 1 4 70

By selling one unit of F1 and one unit of F2, the company gets a profit of ₹ 500 and ₹ 750 respectively. Formulate the problem as LPP to maximize the profit.

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

A doctor has prescribed two different units of foods A and B to form a weekly diet for a sick person. The minimum requirements of fats, carbohydrates and proteins are 18, 28, 14 units respectively. One unit of food A has 4 units of fat, 14 units of carbohydrates and 8 units of protein. One unit of food B has 6 units of fat, 12 units of carbohydrates and 8 units of protein. The price of food A is ₹ 4.5 per unit and that of food B is ₹ 3.5 per unit. Form the LPP, so that the sick person’s diet meets the requirements at a minimum cost.

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

If John drives a car at a speed of 60 km/hour, he has to spend ₹ 5 per km on petrol. If he drives at a faster speed of 90 km/hour, the cost of petrol increases ₹ 8 per km. He has ₹ 600 to spend on petrol and wishes to travel the maximum distance within an hour. Formulate the above problem as L.P.P.

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

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.

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

Solve the following LPP by graphical method:

Maximize z = 11x + 8y, subject to x ≤ 4, y ≤ 6, x + y ≤ 6, x ≥ 0, y ≥ 0

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

Solve the following LPP by graphical method:

Maximize z = 4x + 6y, subject to 3x + 2y ≤ 12, x + y ≥ 4, x, y ≥ 0.

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

Solve the following LPP by graphical method:

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

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

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

Minimize: z = 8x + 10y

Subject to: 2x + y ≥ 7, 2x + 3y ≥ 15, y ≥ 2, x ≥ 0, y ≥ 0.

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

Minimize z = 6x + 21y, subject to x + 2y ≥ 3, x + 4y ≥ 4, 3x + y ≥ 3, x ≥ 0, y ≥ 0.

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

Select the appropriate alternatives for each of the following question:

The value of objective function is maximum under linear constraints

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

Which of the following is correct?

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

Objective function of LPP is ______.

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

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

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

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

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

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

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

Of all the points of the feasible region, the optimal value of z obtained at the point lies ______.

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

Solution of LPP to minimize z = 2x + 3y, such that x ≥ 0, y ≥ 0, 1 ≤ x + 2y ≤ 10 is ______.

[7] Linear Programming
Chapter: [7] Linear Programming
Concept: undefined >> undefined
< prev  6661 to 6680 of 10390  next > 
Advertisements
Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×