Scribd
Upload
10 views2 pages

Act 5 LPP-1

Lpp

Uploaded by

only.creative.minds13
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
10 views2 pages

Act 5 LPP-1

Lpp

Uploaded by

only.creative.minds13
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

ARMY PUBLIC SCHOOL, NOIDA

CLASS XII: MATHEMATICS


ACTIVITY 5: Linear Programming Problem

Objective: To find solution of given linear programming problem and find the
optimal solution.
Material Required: Graph paper, coloured pencil, scale, pencil box.

Method of construction:

1. Convert the given linear inequations to equations and plot them on graph
paper
2. Identify the region represented by each line.
3. Now find and colour the feasible region which satisfies all the constraints.
4. Find the coordinates of the vertices(corner points) of the convex polygon
of the feasible region.
5. Calculate the value of the objective function at every corner point of the
convex polygon and then find the optimal solution of the LPP.

Problem:

A dealer in rural area wishes to purchase a number of sewing machines. He has


only ₹5760.00 to invest and has a space for at most 20 items. An electronic
sewing machine costs him ₹360.00 and a manually operated sewing machine
₹240.00. He can sell electronic sewing machine at a profit of ₹22.00 and a
manually operated sewing machine at a profit of ₹18.00. Assuming that he can
sell all the items that he can buy, how should he invest his money in order to
maximize his profit. The Inequations to represent this situation is given below
solve it graphically.
Let ‘x’ be the number of electronic operated machines and ‘y’ that of manually
operated machines be purchased.
Maximize profit: Z = 22x + 18y
Subject to constraints:
x + y ≤ 20 …(1)
360x + 240y ≤ 5760
i.e. 3x + 2y ≤ 48 …(2)
and x ≥ 0, y ≥ 0 …(3)

Solution:
Then the LPP problem is as follows :
The shaded region of the figure represents the feasible region OCEB, which is
bounded.
Applying Corner Point Method, we have:

Corner Point Corresponding value of Z

O: (0,0) 0

C:(16,0) 352

E: (8,12) 392 (Maximum)

B: (0,20) 360

Observation: Thus, Z is maximum at E (8, 12).

Result: Hence, the dealer should invest in 8 electronic and 12 manually


operated machines.

You might also like