SlideShare a Scribd company logo
1 of 25
A
  PRESENTATION
       ON
   SOLVING LPP
       BY
GRAPHICAL METHOD

   Submitted By:
                   Kratika Dhoot
                   MBA- 2nd sem
What is LPP ???

• Optimization technique
• To find optimal value of objective function, i.e.
  maximum or minimum
• “LINEAR” means all mathematical functions
  are required to be linear…
• “PROGRAMMING” refers to Planning, not
  computer programming…

                                        KRATIKA DHOOT
What is graphical method ???
• One of the LPP method
• Used to solve 2 variable problems of LPP…




                                     KRATIKA DHOOT
Steps for graphical method…
  FORMULATE THE                            OUTLINE THE
      PROBLEM                             SOLUTION AREA
  ( for objective &                    ( area which satisfies
constraints functions)                    the constraints)


                                                                 CIRCLE POTENTIAL
    FRAME THE GRAPH                PLOT THE GRAPH                SOLUTION POINTS
      ( one variable on             ( one variable on             ( the intersection
    horizontal & other at          horizontal & other                points of all
        vertical axes)               at vertical axes)               constraints)



                       PLOT THE CONSTRAINTS
                     (inequality to be as equality;              SUBSTITUTE & FIND
                   give arbitrary value to variables            OPTIMIZED SOLUTION
                      & plot the point on graph )

                                                                      KRATIKA DHOOT
LET US TAKE AN EXAMPLE!!!
  SMALL SCALE
                     ACCOMPLISHED BY       BUT NUMBER OF
   ELECTRICAL
                      SKILLED MEN &        WORKERS CAN’T
  REGULATORS
                     WOMEN WORKERS           EXCEED 11
    INDUSTRY

SALARY BILL NOT      MALE WORKERS ARE       DATA COLLECTED
MORE THAN Rs.         PAID Rs.6,000pm &        FOR THE
   60,000 pm        FEMALE WORKERS ARE      PERFORMANCE
                       PAID Rs.5,000pm


DATA INDICATED MALE MEMBERS        DETERMINE No. OF MALES &
  CONTRIBUTES Rs.10,000pm &        FEMALES TO BE EMPLOYED IN
FEMALE MEMBERS CONTRIBUTES          ORDER TO MAXIMIZE TOTAL
          Rs.8,500pm                        RETURN


                                                 KRATIKA DHOOT
STEP 1-FORMULATE THE PROBLEM
Objective Function :-
Let no. of males be x & no. of females be y
Maximize Z = Contribution of Male members +
 contribution of Female members
             Max Z = 10,000x + 8,500y
Subjected To Constraints :-
      x + y ≤ 11                      ………..(1)
      6,000x + 5,000y ≤ 60,000        ………..(2)

                                              KRATIKA DHOOT
STEP 2- FRAME THE GRAPH
• Let no. of Male Workers(x) be on horizontal axis
  & no. of Female Workers (y) be vertical axis..


        No. of
        females




                         No. of males

                                        KRATIKA DHOOT
STEP 3- PLOT THE CONSTRAINTS
• To plot the constraints, we will opt an arbitrary
  value to the variables as:-
x + y ≤ 11:- converting as x + y = 11
            x            0           11
            y           11            0
6,000x+5,000y≤60,000:- converting as 6x + 5y= 60
            x            0           10
            y           12            0

                                          KRATIKA DHOOT
STEP 4- PLOT THE GRAPH
No. of                                       No. of
females                                      females
    14                                             14
    12
          ●
              ( 0 , 11 )                           12   ●   ( 0 , 12 )
    10                                             10
     8                                             8
     6                                             6
     4                                             4
     2                       ( 11 , 0 )            2                     ( 10 , 0 )

          0
                              ●                         0
                                                                         ●
              2 4 6 8 10 12               No. of            2 4 6 8 10 12             No. of
                                          males                                       males

              x + y ≤ 11                                       6x + 5y ≤60

                                                                         KRATIKA DHOOT
STEP 5- FIND THE OPTIMAL SOLUTION
 No. of females

       12       ●          OPTIMAL
                ●       SOLUTION POINT
       10

       8
                            ( 5, 6 )
       6                    ●
       4                                        FEASIBLE
                                                 REGION
       2

            0                               ● ●
                    2   4       6      8   10   12   No. of males

                                                     KRATIKA DHOOT
STEP 6- CIRCLE POTENTIAL OPTIMAL
             POINTS
No. of females

      12
                 ( 0 , 11 )
      10

      8                       ( 5, 6 )
      6

      4

      2                                       ( 10 , 0 )


           0
      ( 0,0)       2     4      6    8   10   12       No. of males

                                                       KRATIKA DHOOT
STEP 7- SUBSTITUE & OPTIMIZE

               Max Z = 10,000x + 8,500y

 POTENTIAL        Z = 10,000x + 8,500y    MAXIMUM Z
OPTIMAL PTS.

   (0,0)          10,000(0) + 8,500(0)        0
   (0,11)         10,000(0)+8,500(11)      93,500
   (5,6)          10,000(5)+8,500(6)      1,01,000
                                           1,01,000
   (10,0)         10,000(10)+8,500(0)      1,00,000


                                           KRATIKA DHOOT
CONCLUSION
• Thus, maximum total return is about
  Rs.1,01,000 by adopting 5 male workers & 6
  female workers.
• Hence, optimal solution for LPP is :-
     No. of male workers = 5
     No. of female workers = 6
     Max. Z                 = Rs. 1,01,000

                                     KRATIKA DHOOT
Let us take other example!!!
• Find the maximum value of objective function
           Z= 4x + 2y
s.t.             x + 2y ≥ 4
                 3x + y ≥ 7
                 -x + 2y ≤ 7
                 &x≥0&y≥0


                                     KRATIKA DHOOT
PLOT THE CONSTRAINTS
              x   0     4
x + 2y = 4
              y   2     0

              x   0     7/3
3x + y = 7    y   7     0


              x   0     -7
-x + 2y = 7   y   7/2   0

                        KRATIKA DHOOT
PLOTTING
CONSTRAINTS TO
    GRAPH




            KRATIKA DHOOT
x                  0         4
x + 2y ≥ 4
                        y                  2         0



      Y   7
          6
          5
          4
          3
          2
          1
              •   (0,2)

                                  (4,0)
              0
                    1     2   3
                                  •4   5   6 7
                                                 X
                                                     KRATIKA DHOOT
3x + y ≥ 7                  x                0         7/3
                            y                7          0


                  (0,7)
      Y   7
          6
              •
          5
          4
          3
          2
          1
                            ( 7/3 , 0 )
              0
                    1   2
                          •     3   4   5   6 7
                                                  X
                                                      KRATIKA DHOOT
x           0                    -7
-x + 2y ≤ 7          y         7/2                    0


                                              7   Y
                                              6
                                              5
                            ( 0 , 7/2 )       4
                                     •        3
                                              2
        ( -7 , 0 )                            1

              •                           0
              -7 -6 -5 -4 -3 -2 -1
                                          X

                                                  KRATIKA DHOOT
There is a common portion or common points which
         intersects by all 3 regions of lines

                          3x + y ≥ 7

                                                             -x + 2y ≤ 7

                      Y    7
                           6
                           5
         x + 2y ≥ 4
                           4
                           3
                           2
                           1

                               0
                                       1   2   3   4   5    6 7
  -7   -6 -5 -4 -3 -2 -1
                                                                    X
                                                           KRATIKA DHOOT
CIRCLE THE POTENTIAL POINTS!!!

                    Y   7
                        6
                                (1,4)
                        5
                        4
                        3
                        2           (2,1)
                        1
                                                ( 4 ,0 )
                            0
                                1   2   3   4   5    6 7
  -7   -6 -5 -4 -3 -2 -1
                                                            X



                                                    KRATIKA DHOOT
STEP 7- SUBSTITUE & OPTIMIZE

               Max Z = 4x + 2y

 POTENTIAL       Z = 4x + 2y     MAXIMUM Z
OPTIMAL PTS.


   (1,4)        4(1) + 2(4)         12

   (2,1)         4(2)+2(1)          10

   (4,0)        4 (4)+ 2(0)         16
                                     16


                                  KRATIKA DHOOT
CONCLUSION

Hence, the optimal solution is:
            X=4
            Y=0
         Max z = 16




                                  KRATIKA DHOOT
PRACTICE QUESTIONS …
(1) Maximize f(x) = x1 + 2x2
  subject to:        x1 + 2x2 ≤ 3
                     x1 + x2 ≤ 2
                     x1 ≤ 1
              &      x1 , x2 ≥ 0
(2) Maximize z = 4x+2y
  subject to:        4x+6y≥12
                     2x+4y≤4
              &      x≥0 ; y≥0

                                    KRATIKA DHOOT
THANK YOU !!!




                KRATIKA DHOOT

More Related Content

What's hot

Branch and Bound technique to solve Integer Linear Programming
Branch and Bound technique to solve Integer Linear ProgrammingBranch and Bound technique to solve Integer Linear Programming
Branch and Bound technique to solve Integer Linear ProgrammingKaivalya Shah
 
Linear programming - Model formulation, Graphical Method
Linear programming  - Model formulation, Graphical MethodLinear programming  - Model formulation, Graphical Method
Linear programming - Model formulation, Graphical MethodJoseph Konnully
 
Duality in Linear Programming Problem
Duality in Linear Programming ProblemDuality in Linear Programming Problem
Duality in Linear Programming ProblemRAVI PRASAD K.J.
 
Duality in Linear Programming
Duality in Linear ProgrammingDuality in Linear Programming
Duality in Linear Programmingjyothimonc
 
Sensitivity analysis linear programming copy
Sensitivity analysis linear programming   copySensitivity analysis linear programming   copy
Sensitivity analysis linear programming copyKiran Jadhav
 
Sequencing problems in Operations Research
Sequencing problems in Operations ResearchSequencing problems in Operations Research
Sequencing problems in Operations ResearchAbu Bashar
 
Procedure Of Simplex Method
Procedure Of Simplex MethodProcedure Of Simplex Method
Procedure Of Simplex Methoditsvineeth209
 
Simplex method: Slack, Surplus & Artificial variable
Simplex method:  Slack, Surplus & Artificial variableSimplex method:  Slack, Surplus & Artificial variable
Simplex method: Slack, Surplus & Artificial variableDevyaneeDevyanee2007
 
Canonical form and Standard form of LPP
Canonical form and Standard form of LPPCanonical form and Standard form of LPP
Canonical form and Standard form of LPPSundar B N
 
Transportation Problem
Transportation ProblemTransportation Problem
Transportation ProblemAlvin Niere
 
Linear Programming Problems : Dr. Purnima Pandit
Linear Programming Problems : Dr. Purnima PanditLinear Programming Problems : Dr. Purnima Pandit
Linear Programming Problems : Dr. Purnima PanditPurnima Pandit
 
Linear programming
Linear programmingLinear programming
Linear programmingKarnav Rana
 

What's hot (20)

Duality
DualityDuality
Duality
 
Assignment Problem
Assignment ProblemAssignment Problem
Assignment Problem
 
Graphical method
Graphical methodGraphical method
Graphical method
 
Branch and Bound technique to solve Integer Linear Programming
Branch and Bound technique to solve Integer Linear ProgrammingBranch and Bound technique to solve Integer Linear Programming
Branch and Bound technique to solve Integer Linear Programming
 
Linear programming - Model formulation, Graphical Method
Linear programming  - Model formulation, Graphical MethodLinear programming  - Model formulation, Graphical Method
Linear programming - Model formulation, Graphical Method
 
Duality in Linear Programming Problem
Duality in Linear Programming ProblemDuality in Linear Programming Problem
Duality in Linear Programming Problem
 
Big-M Method Presentation
Big-M Method PresentationBig-M Method Presentation
Big-M Method Presentation
 
Duality in Linear Programming
Duality in Linear ProgrammingDuality in Linear Programming
Duality in Linear Programming
 
L20 Simplex Method
L20 Simplex MethodL20 Simplex Method
L20 Simplex Method
 
Assignment model
Assignment modelAssignment model
Assignment model
 
Linear programing
Linear programingLinear programing
Linear programing
 
Sensitivity analysis linear programming copy
Sensitivity analysis linear programming   copySensitivity analysis linear programming   copy
Sensitivity analysis linear programming copy
 
Sequencing problems in Operations Research
Sequencing problems in Operations ResearchSequencing problems in Operations Research
Sequencing problems in Operations Research
 
Procedure Of Simplex Method
Procedure Of Simplex MethodProcedure Of Simplex Method
Procedure Of Simplex Method
 
Simplex method: Slack, Surplus & Artificial variable
Simplex method:  Slack, Surplus & Artificial variableSimplex method:  Slack, Surplus & Artificial variable
Simplex method: Slack, Surplus & Artificial variable
 
Canonical form and Standard form of LPP
Canonical form and Standard form of LPPCanonical form and Standard form of LPP
Canonical form and Standard form of LPP
 
Transportation Problem
Transportation ProblemTransportation Problem
Transportation Problem
 
Linear Programming Problems : Dr. Purnima Pandit
Linear Programming Problems : Dr. Purnima PanditLinear Programming Problems : Dr. Purnima Pandit
Linear Programming Problems : Dr. Purnima Pandit
 
Integer programming
Integer programmingInteger programming
Integer programming
 
Linear programming
Linear programmingLinear programming
Linear programming
 

Viewers also liked

Operational research- main techniques PERT and CPM
Operational research- main techniques PERT and CPMOperational research- main techniques PERT and CPM
Operational research- main techniques PERT and CPMvckg1987
 
Production Management Introduction
Production Management IntroductionProduction Management Introduction
Production Management IntroductionDr. Gururaj Phatak
 
Numerical assignment
Numerical assignmentNumerical assignment
Numerical assignmentAnupam Kumar
 
Program Evaluation and Review Technique (PERT)
Program Evaluation and Review Technique (PERT)Program Evaluation and Review Technique (PERT)
Program Evaluation and Review Technique (PERT)Abhishek Pachisia
 
Chapter 12(cpm pert)
Chapter 12(cpm pert)Chapter 12(cpm pert)
Chapter 12(cpm pert)Debanjan15
 
Network Problem CPM & PERT
Network Problem CPM &  PERTNetwork Problem CPM &  PERT
Network Problem CPM & PERTPulchowk Campus
 

Viewers also liked (7)

Operational research- main techniques PERT and CPM
Operational research- main techniques PERT and CPMOperational research- main techniques PERT and CPM
Operational research- main techniques PERT and CPM
 
Production Management Introduction
Production Management IntroductionProduction Management Introduction
Production Management Introduction
 
Numerical assignment
Numerical assignmentNumerical assignment
Numerical assignment
 
Program Evaluation and Review Technique (PERT)
Program Evaluation and Review Technique (PERT)Program Evaluation and Review Technique (PERT)
Program Evaluation and Review Technique (PERT)
 
Chapter 12(cpm pert)
Chapter 12(cpm pert)Chapter 12(cpm pert)
Chapter 12(cpm pert)
 
Pert
PertPert
Pert
 
Network Problem CPM & PERT
Network Problem CPM &  PERTNetwork Problem CPM &  PERT
Network Problem CPM & PERT
 

Similar to graphical method

graphical-copy-130308123000-phpapp02.pptx
graphical-copy-130308123000-phpapp02.pptxgraphical-copy-130308123000-phpapp02.pptx
graphical-copy-130308123000-phpapp02.pptxABHIJEETKUMAR992494
 
Paris data-geeks-2013-03-28
Paris data-geeks-2013-03-28Paris data-geeks-2013-03-28
Paris data-geeks-2013-03-28Ted Dunning
 
Amth250 octave matlab some solutions (4)
Amth250 octave matlab some solutions (4)Amth250 octave matlab some solutions (4)
Amth250 octave matlab some solutions (4)asghar123456
 
8 queens problem using back tracking
8 queens problem using back tracking8 queens problem using back tracking
8 queens problem using back trackingTech_MX
 
derivative.ppt
derivative.pptderivative.ppt
derivative.pptSpyder20
 
derivative.ppt
derivative.pptderivative.ppt
derivative.pptbahbib22
 
Linear Programming Feasible Region
Linear Programming Feasible RegionLinear Programming Feasible Region
Linear Programming Feasible RegionVARUN MODI
 
Cosmological Perturbations and Numerical Simulations
Cosmological Perturbations and Numerical SimulationsCosmological Perturbations and Numerical Simulations
Cosmological Perturbations and Numerical SimulationsIan Huston
 
Ben Carterette "Advances in Information Retrieval Evaluation"
Ben Carterette "Advances in Information Retrieval Evaluation"Ben Carterette "Advances in Information Retrieval Evaluation"
Ben Carterette "Advances in Information Retrieval Evaluation"Yandex
 
Ben Carterett — Advances in Information Retrieval Evaluation
Ben Carterett — Advances in Information Retrieval EvaluationBen Carterett — Advances in Information Retrieval Evaluation
Ben Carterett — Advances in Information Retrieval Evaluationyaevents
 
CSE460 Lecture 2.pptx.pdf
CSE460 Lecture 2.pptx.pdfCSE460 Lecture 2.pptx.pdf
CSE460 Lecture 2.pptx.pdfFarhanFaruk3
 
Alg2.7 A Notes
Alg2.7 A NotesAlg2.7 A Notes
Alg2.7 A Notesmbetzel
 
Graph functions
Graph functionsGraph functions
Graph functionsdaisy_yani
 
The H.264 Integer Transform
The H.264 Integer TransformThe H.264 Integer Transform
The H.264 Integer TransformIain Richardson
 

Similar to graphical method (14)

graphical-copy-130308123000-phpapp02.pptx
graphical-copy-130308123000-phpapp02.pptxgraphical-copy-130308123000-phpapp02.pptx
graphical-copy-130308123000-phpapp02.pptx
 
Paris data-geeks-2013-03-28
Paris data-geeks-2013-03-28Paris data-geeks-2013-03-28
Paris data-geeks-2013-03-28
 
Amth250 octave matlab some solutions (4)
Amth250 octave matlab some solutions (4)Amth250 octave matlab some solutions (4)
Amth250 octave matlab some solutions (4)
 
8 queens problem using back tracking
8 queens problem using back tracking8 queens problem using back tracking
8 queens problem using back tracking
 
derivative.ppt
derivative.pptderivative.ppt
derivative.ppt
 
derivative.ppt
derivative.pptderivative.ppt
derivative.ppt
 
Linear Programming Feasible Region
Linear Programming Feasible RegionLinear Programming Feasible Region
Linear Programming Feasible Region
 
Cosmological Perturbations and Numerical Simulations
Cosmological Perturbations and Numerical SimulationsCosmological Perturbations and Numerical Simulations
Cosmological Perturbations and Numerical Simulations
 
Ben Carterette "Advances in Information Retrieval Evaluation"
Ben Carterette "Advances in Information Retrieval Evaluation"Ben Carterette "Advances in Information Retrieval Evaluation"
Ben Carterette "Advances in Information Retrieval Evaluation"
 
Ben Carterett — Advances in Information Retrieval Evaluation
Ben Carterett — Advances in Information Retrieval EvaluationBen Carterett — Advances in Information Retrieval Evaluation
Ben Carterett — Advances in Information Retrieval Evaluation
 
CSE460 Lecture 2.pptx.pdf
CSE460 Lecture 2.pptx.pdfCSE460 Lecture 2.pptx.pdf
CSE460 Lecture 2.pptx.pdf
 
Alg2.7 A Notes
Alg2.7 A NotesAlg2.7 A Notes
Alg2.7 A Notes
 
Graph functions
Graph functionsGraph functions
Graph functions
 
The H.264 Integer Transform
The H.264 Integer TransformThe H.264 Integer Transform
The H.264 Integer Transform
 

More from Kratika Dhoot Kogta

More from Kratika Dhoot Kogta (6)

Corporate action and Reference Data Management Intro
Corporate action and Reference Data Management IntroCorporate action and Reference Data Management Intro
Corporate action and Reference Data Management Intro
 
Amendments in acts 2014
Amendments in acts 2014Amendments in acts 2014
Amendments in acts 2014
 
Definition of Wages & Employees/Workers
Definition of Wages & Employees/WorkersDefinition of Wages & Employees/Workers
Definition of Wages & Employees/Workers
 
Compensation as a driver of Competitiveness
Compensation as a driver of CompetitivenessCompensation as a driver of Competitiveness
Compensation as a driver of Competitiveness
 
Public sector
Public sectorPublic sector
Public sector
 
greenhouse effect
greenhouse effectgreenhouse effect
greenhouse effect
 

graphical method

  • 1. A PRESENTATION ON SOLVING LPP BY GRAPHICAL METHOD Submitted By: Kratika Dhoot MBA- 2nd sem
  • 2. What is LPP ??? • Optimization technique • To find optimal value of objective function, i.e. maximum or minimum • “LINEAR” means all mathematical functions are required to be linear… • “PROGRAMMING” refers to Planning, not computer programming… KRATIKA DHOOT
  • 3. What is graphical method ??? • One of the LPP method • Used to solve 2 variable problems of LPP… KRATIKA DHOOT
  • 4. Steps for graphical method… FORMULATE THE OUTLINE THE PROBLEM SOLUTION AREA ( for objective & ( area which satisfies constraints functions) the constraints) CIRCLE POTENTIAL FRAME THE GRAPH PLOT THE GRAPH SOLUTION POINTS ( one variable on ( one variable on ( the intersection horizontal & other at horizontal & other points of all vertical axes) at vertical axes) constraints) PLOT THE CONSTRAINTS (inequality to be as equality; SUBSTITUTE & FIND give arbitrary value to variables OPTIMIZED SOLUTION & plot the point on graph ) KRATIKA DHOOT
  • 5. LET US TAKE AN EXAMPLE!!! SMALL SCALE ACCOMPLISHED BY BUT NUMBER OF ELECTRICAL SKILLED MEN & WORKERS CAN’T REGULATORS WOMEN WORKERS EXCEED 11 INDUSTRY SALARY BILL NOT MALE WORKERS ARE DATA COLLECTED MORE THAN Rs. PAID Rs.6,000pm & FOR THE 60,000 pm FEMALE WORKERS ARE PERFORMANCE PAID Rs.5,000pm DATA INDICATED MALE MEMBERS DETERMINE No. OF MALES & CONTRIBUTES Rs.10,000pm & FEMALES TO BE EMPLOYED IN FEMALE MEMBERS CONTRIBUTES ORDER TO MAXIMIZE TOTAL Rs.8,500pm RETURN KRATIKA DHOOT
  • 6. STEP 1-FORMULATE THE PROBLEM Objective Function :- Let no. of males be x & no. of females be y Maximize Z = Contribution of Male members + contribution of Female members Max Z = 10,000x + 8,500y Subjected To Constraints :- x + y ≤ 11 ………..(1) 6,000x + 5,000y ≤ 60,000 ………..(2) KRATIKA DHOOT
  • 7. STEP 2- FRAME THE GRAPH • Let no. of Male Workers(x) be on horizontal axis & no. of Female Workers (y) be vertical axis.. No. of females No. of males KRATIKA DHOOT
  • 8. STEP 3- PLOT THE CONSTRAINTS • To plot the constraints, we will opt an arbitrary value to the variables as:- x + y ≤ 11:- converting as x + y = 11 x 0 11 y 11 0 6,000x+5,000y≤60,000:- converting as 6x + 5y= 60 x 0 10 y 12 0 KRATIKA DHOOT
  • 9. STEP 4- PLOT THE GRAPH No. of No. of females females 14 14 12 ● ( 0 , 11 ) 12 ● ( 0 , 12 ) 10 10 8 8 6 6 4 4 2 ( 11 , 0 ) 2 ( 10 , 0 ) 0 ● 0 ● 2 4 6 8 10 12 No. of 2 4 6 8 10 12 No. of males males x + y ≤ 11 6x + 5y ≤60 KRATIKA DHOOT
  • 10. STEP 5- FIND THE OPTIMAL SOLUTION No. of females 12 ● OPTIMAL ● SOLUTION POINT 10 8 ( 5, 6 ) 6 ● 4 FEASIBLE REGION 2 0 ● ● 2 4 6 8 10 12 No. of males KRATIKA DHOOT
  • 11. STEP 6- CIRCLE POTENTIAL OPTIMAL POINTS No. of females 12 ( 0 , 11 ) 10 8 ( 5, 6 ) 6 4 2 ( 10 , 0 ) 0 ( 0,0) 2 4 6 8 10 12 No. of males KRATIKA DHOOT
  • 12. STEP 7- SUBSTITUE & OPTIMIZE Max Z = 10,000x + 8,500y POTENTIAL Z = 10,000x + 8,500y MAXIMUM Z OPTIMAL PTS. (0,0) 10,000(0) + 8,500(0) 0 (0,11) 10,000(0)+8,500(11) 93,500 (5,6) 10,000(5)+8,500(6) 1,01,000 1,01,000 (10,0) 10,000(10)+8,500(0) 1,00,000 KRATIKA DHOOT
  • 13. CONCLUSION • Thus, maximum total return is about Rs.1,01,000 by adopting 5 male workers & 6 female workers. • Hence, optimal solution for LPP is :- No. of male workers = 5 No. of female workers = 6 Max. Z = Rs. 1,01,000 KRATIKA DHOOT
  • 14. Let us take other example!!! • Find the maximum value of objective function Z= 4x + 2y s.t. x + 2y ≥ 4 3x + y ≥ 7 -x + 2y ≤ 7 &x≥0&y≥0 KRATIKA DHOOT
  • 15. PLOT THE CONSTRAINTS x 0 4 x + 2y = 4 y 2 0 x 0 7/3 3x + y = 7 y 7 0 x 0 -7 -x + 2y = 7 y 7/2 0 KRATIKA DHOOT
  • 16. PLOTTING CONSTRAINTS TO GRAPH KRATIKA DHOOT
  • 17. x 0 4 x + 2y ≥ 4 y 2 0 Y 7 6 5 4 3 2 1 • (0,2) (4,0) 0 1 2 3 •4 5 6 7 X KRATIKA DHOOT
  • 18. 3x + y ≥ 7 x 0 7/3 y 7 0 (0,7) Y 7 6 • 5 4 3 2 1 ( 7/3 , 0 ) 0 1 2 • 3 4 5 6 7 X KRATIKA DHOOT
  • 19. x 0 -7 -x + 2y ≤ 7 y 7/2 0 7 Y 6 5 ( 0 , 7/2 ) 4 • 3 2 ( -7 , 0 ) 1 • 0 -7 -6 -5 -4 -3 -2 -1 X KRATIKA DHOOT
  • 20. There is a common portion or common points which intersects by all 3 regions of lines 3x + y ≥ 7 -x + 2y ≤ 7 Y 7 6 5 x + 2y ≥ 4 4 3 2 1 0 1 2 3 4 5 6 7 -7 -6 -5 -4 -3 -2 -1 X KRATIKA DHOOT
  • 21. CIRCLE THE POTENTIAL POINTS!!! Y 7 6 (1,4) 5 4 3 2 (2,1) 1 ( 4 ,0 ) 0 1 2 3 4 5 6 7 -7 -6 -5 -4 -3 -2 -1 X KRATIKA DHOOT
  • 22. STEP 7- SUBSTITUE & OPTIMIZE Max Z = 4x + 2y POTENTIAL Z = 4x + 2y MAXIMUM Z OPTIMAL PTS. (1,4) 4(1) + 2(4) 12 (2,1) 4(2)+2(1) 10 (4,0) 4 (4)+ 2(0) 16 16 KRATIKA DHOOT
  • 23. CONCLUSION Hence, the optimal solution is: X=4 Y=0 Max z = 16 KRATIKA DHOOT
  • 24. PRACTICE QUESTIONS … (1) Maximize f(x) = x1 + 2x2 subject to: x1 + 2x2 ≤ 3 x1 + x2 ≤ 2 x1 ≤ 1 & x1 , x2 ≥ 0 (2) Maximize z = 4x+2y subject to: 4x+6y≥12 2x+4y≤4 & x≥0 ; y≥0 KRATIKA DHOOT
  • 25. THANK YOU !!! KRATIKA DHOOT