Linear Programming
Let x passengers travel by executive class and y passengers travel by economy class. Let P be the profit.
Table.
Class |
Number of Tickets |
Profit (Rs.) |
Executive |
x |
1000 x |
Economy |
y |
600 y |
Total |
x + y |
1000 x + 600 y |
We are to maximise
P = 1000 x + 600 y
subject to the constrains
x + y ≤ 200
x ≥ 20
y ≤ 80
x ≥ 0, y ≥ 0
Consider a set of rectangular cartesian axes OXY in the plane.
It is clear that any point which satisfies x ≥ 0, y ≥ 0 lies in the first quadrant.
Now we draw the graph of x + y = 200
For x = 0, y = 200
For y = 0, x = 200
∴ line meets OX in A(200, 0) and OY in L(0, 200).
x = 20 is a straight line BM parallel to y-axis at a distance of 20.
y = 80 is a straight line CN parallel to x-axis at a distance of 80.
Since feasible region satisfies all the Constraints.
∴ DEF is the feasible region.
Sponsor Area
Sponsor Area
Sponsor Area