हिंदी

If the corner points of the feasible solution are (0, 10), (2, 2) and (4, 0), then the point of minimum z = 3x + 2y is ______. - Mathematics and Statistics

Advertisements
Advertisements

प्रश्न

If the corner points of the feasible solution are (0, 10), (2, 2) and (4, 0), then the point of minimum z = 3x + 2y is ______.

विकल्प

  • (2, 2)

  • (2, 2)

  • (0, 10)

  • (0, 10)

  • (4, 0)

  • (4, 0)

  • (3, 4)

  • (2, 4)

MCQ

उत्तर

If the corner points of the feasible solution are (0, 10), (2, 2) and (4, 0), then the point of minimum z = 3x + 2y is (2, 2).

Explanation:

Z = 3x + 2y

At (0, 10) = Z = 0 + 2 (10) = 20

At (2, 2), = Z = 3 (2) + 2 (2) = 10

At (4, 0), Z = 3 (4) + 0 = 12

The minimum value of Z is 10 and it occurs at (2, 2).

shaalaa.com

Notes

The answer in the textbook is incorrect.

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

APPEARS IN

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

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

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


Find the feasible solution of the following inequation:

3x + 4y ≥ 12, 4x + 7y ≤ 28, y ≥ 1, x ≥ 0.


Find the feasible solution of the following inequation:

x + 4y ≤ 24, 3x + y ≤ 21, x + y ≤ 9,  x ≥ 0, y ≥ 0.


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.


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.


Solve the following LPP by graphical method:

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


Select the appropriate alternatives for each of the following question:

The value of objective function is maximum under linear constraints


Objective function of LPP is ______.


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


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


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 ______.


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


The corner points of the feasible solution given by the inequation x + y ≤ 4, 2x + y ≤ 7, x ≥ 0, y ≥ 0 are ______.


The corner points of the feasible solution are (0, 0), (2, 0), `(12/7, 3/7)`, (0, 1). Then z = 7x + y is maximum at ______.


The half-plane represented by 3x + 2y < 8 contains the point ______.


The half-plane represented by 4x + 3y >14 contains the point ______.


Solve each of the following inequations graphically using XY-plane:

4x - 18 ≥ 0


Solve each of the following inequations graphically using XY-plane:

- 11x - 55 ≤ 0


Solve each of the following inequations graphically using XY-plane:

y ≤ - 3.5


Solve the following LPP:

Maximize z = 4x1 + 3x2 subject to
3x1 + x2 ≤ 15, 3x1 + 4x2 ≤ 24, x1 ≥ 0, x2 ≥ 0. 


Solve the following LPP:

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 availability of each machine is given by the following table:

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

Formulate the above problem as LPP. Solve it graphically


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?


A company manufactures two types of chemicals A and 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.

Raw Material \Chemical A B Availability
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. Formulate the problem as L.P.P. to maximize the profit.


A printing company prints two types of magazines A and B. The company earns ₹ 10 and ₹ 15 on 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, 60 hours per week respectively. Formulate the Linear programming problem to maximize the profit.


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 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. If maximum availability of Machine M1 is 10 hours and that of Machine M2 is 12 hours, then formulate the L.P.P. to maximize the profit.


Objective function of LPP is ______.


Choose the correct alternative :

The corner points of the feasible region given by the inequations x + y ≤ 4, 2x + y ≤ 7, x ≥ 0, y ≥ 0, are


Choose the correct alternative :

The corner points of the feasible region are (0, 0), (2, 0), `(12/7, 3/7)` and (0,1) then the point of maximum z = 7x + y


Choose the correct alternative :

The half plane represented by 3x + 2y ≤ 0 constraints the point.


Fill in the blank :

“A gorage employs eight men to work in its shownroom and repair shop. The constraints that there must be at least 3 men in showroom and at least 2 men in repair shop are ______ and _______ respectively.


A train carries at least twice as many first class passengers (y) as second class passengers (x) The constraint is given by_______


Fill in the blank :

A dish washing machine holds up to 40 pieces of large crockery (x) This constraint is given by_______.


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.


State whether the following is True or False :

The point (1, 2) is not a vertex of the feasible region bounded by 2x + 3y ≤ 6, 5x + 3y ≤ 15, x ≥ 0, y ≥ 0.


The feasible region is the set of point which satisfy.


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


Maximize z = 10x + 25y subject to x + y ≤ 5, 0 ≤ x ≤ 3, 0 ≤ y ≤ 3


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


The variables involved in LPP are called ______


A company manufactures two models of voltage stabilizers viz., ordinary and auto-cut. All components of the stabilizers are purchased from outside sources, assembly and testing is carried out at the company’s own works. The assembly and testing time required for the two models are 0.8 hours each for ordinary and 1.20 hours each for auto-cut. Manufacturing capacity 720 hours at present is available per week. The market for the two models has been surveyed which suggests a maximum weekly sale of 600 units of ordinary and 400 units of auto-cut. Profit per unit for ordinary and auto-cut models has been estimated at ₹ 100 and ₹ 150 respectively. Formulate the linear programming problem.


Solve the following linear programming problems by graphical method.

Maximize Z = 6x1 + 8x2 subject to constraints 30x1 + 20x2 ≤ 300; 5x1 + 10x2 ≤ 110; and x1, x2 ≥ 0.


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 problems by graphical method.

Minimize Z = 3x1 + 2x2 subject to the constraints 5x1 + x2 ≥ 10; x1 + x2 ≥ 6; x1 + 4x2 ≥ 12 and x1, x2 ≥ 0.


Solve the following linear programming problems by graphical method.

Maximize Z = 40x1 + 50x2 subject to constraints 3x1 + x2 ≤ 9; x1 + 2x2 ≤ 8 and x1, x2 ≥ 0.


The maximum value of the objective function Z = 3x + 5y subject to the constraints x ≥ 0, y ≥ 0 and 2x + 5y ≤ 10 is


Solve the following linear programming problem graphically.

Maximise Z = 4x1 + x2 subject to the constraints x1 + x2 ≤ 50; 3x1 + x2 ≤ 90 and x1 ≥ 0, 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.


The maximum value of Z = 3x + 5y, subject to 3x + 2y ≤ 18, x ≤ a, y ≤ 6, x, y ≥ 0 is ______.


The maximum value of Z = 9x + 13y subject to constraints 2x + 3y ≤ 18, 2x + y ≤ 10, x ≥ 0, y ≥ 0 is ______.


Solve the following LPP by graphical method:

Maximize: z = 3x + 5y Subject to:  x + 4y ≤ 24, 3x + y ≤ 21, x + y ≤ 9, x ≥ 0, y ≥ 0


Solve the following LPP:

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


Two kinds of foods A and B are being considered to form a weekly diet. The minimum weekly requirements of fats, Carbohydrates and proteins are 12, 16 and 15 units respectively. One kg of food A has 2, 8 and 5 units respectively of these ingredients and one kg of food B has 6, 2 and 3 units respectively. The price of food A is Rs. 4 per kg and that of food B is Rs. 3 per kg. Formulate the L.P.P. and find the minimum cost.


Sketch the graph of the following inequation in XOY co-ordinate system.

x + y ≤ 0


Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×