English

The point of which the maximum value of z= x + y subject to constraints x + 2y ≤ 70, 2x + y ≤ 90, x≥ 0, y≥ 0 is obtained at - Mathematics and Statistics

Advertisements
Advertisements

Question

The point of which the maximum value of z = x + y subject to constraints x + 2y ≤ 70, 2x + y ≤ 90, x ≥ 0, y ≥ 0 is obtained at

Options

  • (30, 25)

  • (20, 35)

  • (35, 20)

  • (40, 15)

MCQ
Advertisements

Solution

(40, 15)

shaalaa.com
Linear Programming Problem (L.P.P.)
  Is there an error in this question or solution?
Chapter 1.7: Linear Programming Problems - MCQ

RELATED QUESTIONS

Which of the following statements is correct?


Find the feasible solution of the following inequations:

x - 2y ≤ 2, x + y ≥ 3, - 2x + y ≤ 4, x ≥ 0, y ≥ 0


A company produces two types of articles A and B which requires silver and gold. Each unit of A requires 3 gm of silver and 1 gm of gold, while each unit of B requires 2 gm of silver and 2 gm of gold. The company has 6 gm of silver and 4 gm of gold. Construct the inequations and find feasible solution graphically.


Solve the following LPP by graphical method:

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


Solve the following LPP by graphical method:

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


Select the appropriate alternatives for each of the following question:

The value of objective function is maximum under linear constraints


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


Solve the following LPP:

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


Solve the following LPP:

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


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 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 firm manufactures two products A and B on which profit earned per unit are ₹ 3 and ₹ 4 respectively. Each product is processed on two machines M1 and M2. The product A requires one minute of processing time on M1 and two minutes of processing time on M2, B requires one minute of processing time on M1 and one minute of processing time on M2. Machine M1 is available for use for 450 minutes while M2 is available for 600 minutes during any working day. Find the number of units of products A and B to be manufactured to get the maximum profit.


In a cattle breeding firm, it is prescribed that the food ration for one animal must contain 14, 22, and 1 unit of nutrients A, B, and C respectively. Two different kinds of fodder are available. Each unit weight of these two contains the following amounts of these three nutrients:

Nutrient\Fodder Fodder 1 Fodder2
Nutrient A 2 1
Nutrient B 2 3
Nutrient C 1 1

The cost of fodder 1 is ₹ 3 per unit and that of fodder ₹ 2 per unit. Formulate the L.P.P. to minimize the cost.


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:

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

By selling one unit of F1 and one unit of F2, company gets a profit of ₹ 500 and ₹ 750 respectively. Formulate the problem as L.P.P. to maximize the 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 :

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


Choose the correct alternative :

Feasible region; the set of points which satify.


Choose the correct alternative :

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


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


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


Choose the correct alternative :

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


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.


Solve the Linear Programming problem graphically:

Maximize z = 3x + 5y subject to x + 4y ≤ 24, 3x + y ≤ 21, x + y ≤ 9, x ≥ 0, y ≥ 0 also find the maximum value of z.


Minimize z = 7x + y subjected to 5x + y ≥ 5, x + y ≥ 3, x ≥ 0, y ≥ 0.


Maximize z = −x + 2y subjected to constraints x + y ≥ 5, x ≥ 3, x + 2y ≥ 6, y ≥ 0 is this LPP solvable? Justify your answer.


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.


Maximize: z = 3x1 + 4x2 subject to 2x1 + x2 ≤ 40, 2x1 + 5x2 ≤ 180, x1, x2 ≥ 0. In the LPP, which one of the following is feasible comer point?


In the given graph the coordinates of M1 are


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


Given an L.P.P maximize Z = 2x1 + 3x2 subject to the constrains x1 + x2 ≤ 1, 5x1 + 5x2 ≥ 0 and x1 ≥ 0, x2 ≥ 0 using graphical method, we observe


Solve the following linear programming problem graphically.

Maximize Z = 3x1 + 5x2 subject to the constraints: x1 + x2 ≤ 6, x1 ≤ 4; x2 ≤ 5, and x1, x2 ≥ 0.


The LPP to maximize Z = x + y, subject to x + y ≤ 1, 2x + 2y ≥ 6, x ≥ 0, y ≥ 0 has ________.


The minimum value of z = 5x + 13y subject to constraints 2x + 3y ≤ 18, x + y ≥ 10, x ≥ 0, y ≥ 2 is ______ 


Solve the following LP.P.

Maximize z = 13x + 9y,

Subject to 3x + 2y ≤ 12,

x + y ≥ 4,

x ≥ 0,

y ≥ 0.


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


Solve the following LPP:

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


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

2y - 5x ≥ 0


Find graphical solution for the following system of linear in equation:

x + 2y ≥ 4, 2x - y ≤ 6


Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×