हिंदी

State whether the following is True or False : Saina wants to invest at most ₹ 24000 in bonds and fixed deposits. Mathematically this constraints is written as x + y ≤ 24000 where x is investment in - Mathematics and Statistics

Advertisements
Advertisements

प्रश्न

State whether the following is True or False :

Saina wants to invest at most ₹ 24000 in bonds and fixed deposits. Mathematically this constraints is written as x + y ≤ 24000 where x is investment in bond and y is in fixed deposits.

विकल्प

  • True

  • False

MCQ
सत्य या असत्य

उत्तर

Saina wants to invest at most ₹ 24000 in bonds and fixed deposits. Mathematically this constraints is written as x + y ≤ 24000 where x is investment in bond and y is in fixed deposits True.

shaalaa.com
Linear Programming Problem (L.P.P.)
  क्या इस प्रश्न या उत्तर में कोई त्रुटि है?
अध्याय 6: Linear Programming - Miscellaneous Exercise 6 [पृष्ठ १०४]

APPEARS IN

बालभारती Mathematics and Statistics 2 (Commerce) [English] 12 Standard HSC Maharashtra State Board
अध्याय 6 Linear Programming
Miscellaneous Exercise 6 | Q 3.5 | पृष्ठ १०४

संबंधित प्रश्न

Which of the following statements is correct?


Find the feasible solution of the following inequation:

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


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.


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.


Select the appropriate alternatives for each of the following question:

The value of objective function is maximum under linear constraints


Which of the following is correct?


Solve the following LPP:

Maximize z = 5x1 + 6x2 subject to 2x1 + 3x2 ≤ 18, 2x1 + x2 ≤ 12, x1 ≥ 0, x2 ≥ 0.


Solve the following LPP:

Maximize z = 6x + 10y subject to 3x + 5y ≤ 10, 5x + 3y ≤ 15, x ≥ 0, y ≥ 0.


A firm manufacturing two types of electrical items A and B, can make a profit of ₹ 20 per unit of A and ₹ 30 per unit of B. Both A and B make use of two essential components a motor and a transformer. Each unit of A requires 3 motors and 2 transformers and each units of B requires 2 motors and 4 transformers. The total supply of components per month is restricted to 210 motors and 300 transformers. How many units of A and B should be manufactured per month to maximize profit? How much is the maximum profit?


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

Maximize: Z = 4x + 6y

Subject to 3x + 2y ≤ 12, x + y ≥ 4, x, y ≥ 0.


Choose the correct alternative :

Which of the following is correct?


Choose the correct alternative :

Of all the points of the feasible region the optimal value of z is obtained at a point


Fill in the blank :

The optimal value of the objective function is attained at the _______ points of feasible region.


State whether the following is True or False :

The feasible solution of LPP belongs to only quadrant I.


The feasible region is the set of point which satisfy.


Minimize z = 6x + 21y subject to x + 2y ≥ 3, x + 4y ≥ 4, 3x + y ≥ 3, x ≥ 0, y ≥ 0 show that the minimum value of z occurs at more than two points


Constraints are always in the form of ______ or ______.


A company produces two types of products say type A and B. Profits on the two types of product are ₹ 30/- and ₹ 40/- per kg respectively. The data on resources required and availability of resources are given below.

  Requirements Capacity available per month
Product A Product B
Raw material (kgs) 60 120 12000
Machining hours/piece 8 5 600
Assembling (man hours) 3 4 500

Formulate this problem as a linear programming problem to maximize the profit.


Solve the following linear programming problems by graphical method.

Maximize Z = 22x1 + 18x2 subject to constraints 960x1 + 640x2 ≤ 15360; x1 + x2 ≤ 20 and x1, x2 ≥ 0.


Solve the following linear programming problem graphically.

Maximize Z = 60x1 + 15x2 subject to the constraints: x1 + x2 ≤ 50; 3x1 + x2 ≤ 90 and x1, x2 ≥ 0.


Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×