English

Solve the following L.P.P. by graphical method: Maximize: Z = 4x + 6y Subject to 3x + 2y ≤ 12, x + y ≥ 4, x, y ≥ 0. - Mathematics and Statistics

Advertisements
Advertisements

Question

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

Maximize: Z = 4x + 6y

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

Graph

Solution

The draw the feasible region, construct table as follows:

Inequality 3x + 2y ≤ 12 x + y ≥ 4
Corresponding equation (of line) 3x + 2y = 12 x + y = 4
Intersection of line with X-axis (4, 0) (4, 0)
Intersection of line with Y-axis (0, 6) (0, 4)
Region Origin side Non-origin side


Shaded portion ABC is the feasible region,

Whose vertices are A(4, 0), B(0, 6), C(0, 4).

Here, the objective function is Z = 4x + 6y

∴ Z at A(4, 0) = 4(4) + 6(0) = 16

Z at B(0, 6) = 4(0) + 6(6) = 36

Z at C(0, 4) = 4(0) + 6(4) = 24

∴ Z has maximum value 36 at B(0, 6)

∴ Z is maximum when x = 0 and y = 6.

shaalaa.com
Linear Programming Problem (L.P.P.)
  Is there an error in this question or solution?
Chapter 6: Linear Programming - Exercise 6.2 [Page 101]

RELATED QUESTIONS

Find the feasible solution of the following inequation:

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


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.


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


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


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


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

- 11x - 55 ≤ 0


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

|x + 5| ≤ y


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


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


Fill in the blank :

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


Fill in the blank :

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


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


x − y ≤ 1, x − y ≥ 0, x ≥ 0, y ≥ 0 are the constant for the objective function z = x + y. It is solvable for finding optimum value of z? Justify?


Constraints are always in the form of ______ or ______.


A company produces two types of pens A and B. Pen A is of superior quality and pen B is of lower quality. Profits on pens A and B are ₹ 5 and ₹ 3 per pen respectively. Raw materials required for each pen A is twice as that of pen B. The supply of raw material is sufficient only for 1000 pens per day. Pen A requires a special clip and only 400 such clips are available per day. For pen B, only 700 clips are available per day. Formulate this problem as a linear programming problem.


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.


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


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.


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


The point which provides the solution of the linear programming problem, Max.(45x + 55y) subject to constraints x, y ≥ 0, 6x + 4y ≤ 120, 3x + 10y ≤ 180, is ______ 


Solution which satisfy all constraints is called ______ solution.


Shamli wants to invest ₹ 50, 000 in saving certificates and PPF. She wants to invest atleast ₹ 15,000 in saving certificates and at least ₹ 20,000 in PPF. The rate of interest on saving certificates is 8% p.a. and that on PPF is 9% p.a. Formulation of the above problem as LPP to determine maximum yearly income, is ______.


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

x + y ≤ 0


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

2y - 5x ≥ 0


Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×