Scribd Logo
Upload

Welcome to Scribd!

  • 1K views

    Or Graphical

    Uploaded by

    abishek_mithun
    The document describes the graphical method for solving linear programming problems (LPP) in 6 steps: 1) Formulate the LPP, 2) Draw the graph of the LPP, 3) Obtain the feasible region, 4) Find the corner point solutions, 5) Calculate the objective function values at these points, 6) Choose the optimal solution based on maximization or minimization. Several examples are provided and solved graphically to maximize or minimize objectives subject to constraints. Students are assigned homework problems to practice solving LPPs graphically.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PPT, PDF, TXT or read online from Scribd

    Or Graphical

    Uploaded by

    abishek_mithun
    1K views14 pages
    The document describes the graphical method for solving linear programming problems (LPP) in 6 steps: 1) Formulate the LPP, 2) Draw the graph of the LPP, 3) Obtain the feasible region, 4) Find the corner point solutions, 5) Calculate the objective function values at these points, 6) Choose the optimal solution based on maximization or minimization. Several examples are provided and solved graphically to maximize or minimize objectives subject to constraints. Students are assigned homework problems to practice solving LPPs graphically.

    Copyright

    © Attribution Non-Commercial (BY-NC)

    Available Formats

    PPT, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    The document describes the graphical method for solving linear programming problems (LPP) in 6 steps: 1) Formulate the LPP, 2) Draw the graph of the LPP, 3) Obtain the feasible region, 4) Find the corner point solutions, 5) Calculate the objective function values at these points, 6) Choose the optimal solution based on maximization or minimization. Several examples are provided and solved graphically to maximize or minimize objectives subject to constraints. Students are assigned homework problems to practice solving LPPs graphically.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PPT, PDF, TXT or read online from Scribd
    Download as ppt, pdf, or txt
    1K views14 pages

    Or Graphical

    Uploaded by

    abishek_mithun
    The document describes the graphical method for solving linear programming problems (LPP) in 6 steps: 1) Formulate the LPP, 2) Draw the graph of the LPP, 3) Obtain the feasible region, 4) Find the corner point solutions, 5) Calculate the objective function values at these points, 6) Choose the optimal solution based on maximization or minimization. Several examples are provided and solved graphically to maximize or minimize objectives subject to constraints. Students are assigned homework problems to practice solving LPPs graphically.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PPT, PDF, TXT or read online from Scribd
    Download as ppt, pdf, or txt
    You are on page 1of 14

    Linear Programming by Graphical Method

    Algorithm of finding solution by Graphical Method:

    I : Formulate the appropriate LPP. II : Draw the graph of LPP. III : Obtain a feasible region ( a region which is common to all the constraints of LPP) . IV: Obtain the solution points( the corner points and intersections points of feasible region) V : Calculate the values of objective function at the solution points. VI : For maximization problem, the optimum solution is the solution point which gives the maximum value of the objective function and for minimization problem solution is the solution point that gives the minimum value of objective function.
    B B Tripathy SIOM 1

    Solving LPP by Graphical Method

    Maximize Z = 3x1 + 2 x2 subject to x1 x1 + 3x2 2x1 + x2 and x1 0, x2

    4 15 10 0.

    B B Tripathy SIOM

    B B Tripathy SIOM

    The exact value of (x1, x2) for each of these nine corner-point solutions (A, B, ..., I)

    Corner-point feasible solutions


    A C

    (x1, x2)

    Objective Value Z
    3*0+2*5 = 10 3*3+2*4 = 17

    (0, 5) (3, 4)

    E
    F I

    (4, 2)
    (4, 0) (0, 0)
    B B Tripathy SIOM

    3*4+2*2 = 16
    3*4+2*0 = 12 3*0+0*0 = 0
    4

    Since point C has the largest value of Z, (x1, x2) = (3, 4) must be an optimal solution. The objective function value is 17.

    B B Tripathy SIOM

    Problem I (Solve by Graphical Method)

    Maximize : Z = 250x1 + 200x2


    Subject to constraints

    6x1 + 4x2 240 2x1 + 5x2 150 4x1 + 3x2 120 x2 20 x1 , x2 0

    B B Tripathy SIOM

    Problem II (Solve by Graphical Method) By Using TORA Software

    Minimize : Z = 3x1 + 2x2


    Subject to constraints

    5x1 + x2 10 x1 + x2 6 x1+ 4x2 12 x1 , x2 0

    B B Tripathy SIOM

    Special Case in LPP Graphical Method

    Maximize : Z = 10x1 + 3x2


    Subject to constraints

    2x1 + 3x2 18 6x1 + 5x2 60


    x1 , x2 0

    B B Tripathy SIOM

    Special Case in LPP Graphical Method

    Maximize : Z = 12x1 + 25x2


    Subject to constraints

    12x1 + 3x2 36 15x1 - 5x2 30


    x1 , x2 0

    B B Tripathy SIOM

    Special Case in LPP Graphical Method

    Maximize : Z = 20x1 + 10x2


    Subject to constraints 10x1 + 5x2 50 6x1 + 10x2 60 4x1 + 12x2 48 x1 , x2 0
    B B Tripathy SIOM 10

    Problem II (Solve by Graphical Method) By Using QM for Window Software

    Maximize : Z = 5x1 + 7x2 Subject to constraints x1 + x2 4 3x1 + 8x2 24 10x1 + 7x2 35 x1 , x2 0

    B B Tripathy SIOM

    11

    Home Assignment (GLPP) - I By using graph paper Maximize : Z = 3x1 +4x2 Subject to constraints 5x1 + 4x2 200 3x1 + 5x2 150 5x1 + 4x1 100 8x1 + 4x2 80 x1 , x2 0

    B B Tripathy SIOM

    12

    Home Assignment (GLPP) - II By Using TORA Software

    Minimize : Z = 20x1 + 10x2


    Subject to constraints

    x1 +2x2 40 3x1 + x2 30 4x1 + 3x2 60 x1 , x2 0

    B B Tripathy SIOM

    13

    Home Assignment (GLPP) III By Using QM for Window software

    Maximize : Z = 1170x1 +1110x2


    Subject to constraints 9x1 + 5x2 450 7x1 + 9x2 315 5x1 + 3x1 1500 7x1 + 9x2 1890 2x1 + 4x2 1000 x1 , x 2 0

    B B Tripathy SIOM

    14

    You might also like