Scribd
Upload
90 views21 pages

Linear Prog. Prob 1

Linear Programming Problem Class 12

Uploaded by

ozesahmed
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
90 views21 pages

Linear Prog. Prob 1

Linear Programming Problem Class 12

Uploaded by

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

Linear Programming

Ch. No. 7, Mathematics Part-1


Contents:
• Linear Inequalities:
• Graphical Representations of linear inequalities
• Graphical Solutions of linear inequalities

• Linear Programming Problem:


• Meaning of L.P.P.
• Mathematical Formulation of L.P.P.
• Solution of L.P.P. by graphical methods
Linear Inequalities:
• Definition:
• An expression of the form or where simultaneously and both
• E.g.
i.
ii.
iii.
iv.
v.
Etc.
Graphical Representation of Linear
Inequalities:
• The inequality ax + by (≤ or ≥) c, graphically, is a
region on any one side of the straight line in the
coordinate system, depending on the sign of inequality.
• It means while representing an inequality graphically we
will,
1) Draw the line using at least two/three points
2) Shade the appropriate region based on the ≤ or ≥ sign. (For
this the Origin/Non-origin side helps.)
3) The shaded area shows the solution set (Feasible Region).
To find solutions of
graphically:

• If (a,b,c)then • If (a,b,c)then

• The feasible region will be Non-


• The feasible region will be Origin
Origin side as O(0,0) does not satisfy
side as O(0,0) satisfies the
the inequality.
inequality.
Question for Practice:
Show the solution sets (Feasible Regions) for the following
inequations graphically or Solve the following inequations
graphically.
1)
Sol.:
Step-1: Draw the line
Step-2: Check for the O(0,0).
Here O(0,0) satisfies the inequality.
Step-3: Shade the Origin Side.
2)
Sol.:
Step-1: Draw the line
Step-2: Check for the O(0,0).
Here O(0,0) satisfies the inequality.
Step-3: Shade the Origin Side.
3)
Sol.:
Step-1: Draw the line
0 2 -2
0 -1 1

Step-2: As the origin lies on the line,


we have to choose another point.
Let us choose (-2,-2).

Step-3: Shade the below side.


4)
Sol.:
Step-1: Draw the line
0 3
2 0
(0,2) (3,0)

Step-2: At (0,0),
(Not )
i.e. Origin does not satisfy the inequality.
Step-3: Shade the Non-origin side.
5) Solve graphically and
Sol.:
Step-1: Draw the two lines and

Equation of The Sig Side/


the line point n Region

0 2 (0,2) Non-
Origin
1 0 (1,0) Side

0 -1 (0,-1) Origin
1 0 (1,0) Side

The commonly shaded region gives the required solution


6) Find the graphical solution of , , ,
Sol.:
Step-1: Draw the two lines and

Equation of The Sig Side/


the line point n Region

0 10 (0,10) Origin
5 0 (5,0) Side

0 -2 (0,-2) Non-
Origin
1 0 (1,0) Side

The commonly shaded region OABCO gives the required GRAPHICAL solution
Linear Programming Problem:
• Definition:
• A L.P.P. may be defined as the problem of maximizing or
minimizing a linear function subject to linear constraints.
These constraints may be equations or inequations.
• Linear Programming Problem includes:
• Decision variables
• Objective function
• Constraints
• Non-negativity constraints
Mathematical Formulation of L.P.P.
Linear Programming Problem:
• Steps:
1) Identify the decision variables (x, y) or (x1, x2).
2) Identify the objective function and write it as mathematical
expression in terms of decision variables.
3) Identify the different constraints and express them as
mathematical equations / inequations
Note: In Our Syllabus, We shall study L.P.P. with at most two
variables.
Let’s Formulate a L.P.P:
Example-1:
A company manufactures two types of toys A and B. Each toy of type A requires 2 minutes for
cutting and 1 minute for assembling. Each toy of type B requires 3 minutes for cutting and 4
minutes for assembling. There are 3 hours available for cutting and 2 hours are available for
assembling. On selling a toy of type A the company gets a profit of Rs.10 and that on toy of
type B is Rs. 20. Formulate the L.P.P. to maximize profit.
Step-1: Decision Variables:-
Let the company manufactures, Hence, the required LPP
No. of type-A toys = x & No. of type-B toys = y and obviously is;
Step-2: Objective Function:- P = Total Profit. Hence Maximize the Profit
Step-3: Constraints:- Consider the table,
Toy type-A Toy type-B Subject to the
Activity Available conditions,
(x) (y)
180 mins (3
Cutting 2 mins 3 mins
Hrs)
120 mins (2
Let’s Formulate another L.P.P:
Example-2:
A Toy manufacturer produces bicycles and tricycles, each of which must be processed through two
machine A and B. Machine A has maximum of 120 hours available and machine B has a maximum
of 180 hours available. Manufacturing a bicycle requires 4 hours on machine A and 10 hours on
machine B. Manufacturing a tricycle required 6 hours on machine A and 3 hours on machine B. If
profits are Rs.65 for a bicycle and Rs.45 for a tricycle, formulate L.P.P. to have maximum profit.
Step-1: Decision Variables:-
Let the company manufactures,
Hence, the required LPP
No. of Tricycles= x & No. of No. of Bicycles= y and obviously is;
Step-2: Objective Function:- P = Total Profit. Hence Maximize the Profit
Step-3: Constraints:- Consider the table,
Machine Tricycles (x) Bicycles (y) Available Subject to the
A 6 4 120 conditions,
B 3 10 180

Thus, the constraints are


Solution of a L.P.P.
• Definition:
A set of values of the given variables which satisfy all the constraints of the L.P.P.
is called the solution of that L.P.P.
• Theorem (Without proof): The objective function of L.P.P. attains its optimum value
(either maximum or minimum) at least at one of the vertices of convex polygon.
This is known as convex polygon theorem
• Steps for solving L.P.P. (Corner-Point Method):
1) Formulate the L.P.P if not given.
2) Convert all the inequations of the constraints into equations.
3) Draw the lines in X - Y plane
4) Locate common region indicated by the constraints
5) Find the vertices of feasible region
6) Find the value of the objective function z at all vertices of feasible region
Let’s solve some L.P.P.s.
Example-1:
Maximize : z = 9x + 13y subject to 2x + 3y ≤ 18, 2x + y ≤ 10, x ≥
0, y ≥ 0.
Solution:
• Step-1: Not needed here.
• Step-2&3: Draw line 2x + 3y =18 and 2x + y = 10
• Step-4: Locate the Common Region • Step-5: The common shaded region is O
A B C O which is feasible region with
vertices
O (0, 0), A (5, 0), B (3, 4), C (0, 6).
• Step-6: For maximum value of z,
consider the table.

• Hence from the table, maximum value


of z i.e. z = 79, occurs at B (3, 4)
Let’s solve some L.P.P.s.
Example-2:
Minimize : z = 5x + 2y subject to 5x + y ≥ 10, x + y ≥ 6, x ≥ 0, y ≥
0.
Solution:
• Step-1: Not needed here.
• Step-2&3: Draw line 5x + y = 10 and x + y = 6
• Step-4: Locate the Common Region • Step-5: The common shaded region is
feasible region with vertices
A (6, 0), B (1, 5), C (0, 10).
• Step-6: For minimum value of z,
consider the table.

• Hence from the table, minimum value


of z i.e. z = 15, occurs at B (1, 5)
• i.e. when x = 1, y = 5

You might also like