Scribd Logo
Upload

Welcome to Scribd!

  • 12 views

    Print This Solution Close This Solution

    Uploaded by

    Mr. V. Ramachandran Mech
    This document uses a graphical method to solve a linear programming problem to maximize an objective function Z = 6x1 + 5x2, subject to the constraints x1 + x2 ≤ 5, 3x1 + 2x2 ≤ 12, x1, x2 ≥ 0. It identifies the extreme points as (0,0), (4,0), (2,3), and (0,5) and calculates the objective function value at each point. The maximum value of 27 occurs at the point (2,3), so the optimal solution is x1 = 2, x2 = 3, with the maximum value of Z being 27.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content

    You might also like

    Print This Solution Close This Solution

    Uploaded by

    Mr. V. Ramachandran Mech
    12 views2 pages
    This document uses a graphical method to solve a linear programming problem to maximize an objective function Z = 6x1 + 5x2, subject to the constraints x1 + x2 ≤ 5, 3x1 + 2x2 ≤ 12, x1, x2 ≥ 0. It identifies the extreme points as (0,0), (4,0), (2,3), and (0,5) and calculates the objective function value at each point. The maximum value of 27 occurs at the point (2,3), so the optimal solution is x1 = 2, x2 = 3, with the maximum value of Z being 27.

    Original Description:

    sfdas

    Original Title

    Graphical Method

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This document uses a graphical method to solve a linear programming problem to maximize an objective function Z = 6x1 + 5x2, subject to the constraints x1 + x2 ≤ 5, 3x1 + 2x2 ≤ 12, x1, x2 ≥ 0. It identifies the extreme points as (0,0), (4,0), (2,3), and (0,5) and calculates the objective function value at each point. The maximum value of 27 occurs at the point (2,3), so the optimal solution is x1 = 2, x2 = 3, with the maximum value of Z being 27.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pdf or txt
    12 views2 pages

    Print This Solution Close This Solution

    Uploaded by

    Mr. V. Ramachandran Mech
    This document uses a graphical method to solve a linear programming problem to maximize an objective function Z = 6x1 + 5x2, subject to the constraints x1 + x2 ≤ 5, 3x1 + 2x2 ≤ 12, x1, x2 ≥ 0. It identifies the extreme points as (0,0), (4,0), (2,3), and (0,5) and calculates the objective function value at each point. The maximum value of 27 occurs at the point (2,3), so the optimal solution is x1 = 2, x2 = 3, with the maximum value of Z being 27.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pdf or txt
    of 2

    2/20/2017 Graphical method

    Print This Solution Close This Solution

    Find solution using graphical method

    Problem is 
    MAX Z = x 6 x1 + 5 x2

    subject to
    x1 + x2 ≤5
    3 x1 + 2 x2 ≤ 12
    and x 1, x2 ≥ 0;

    The value of the objective function at each of these extreme points is as follows: 
    Extreme Point
    Coordinates Lines through Extreme Point Objective function value
    Z = 6x + 5x
    (x ,x ) 1 2
    1 2

    3 → x1 ≥ 0
    O(0, 0) 6(0) + 5(0) = 0
    4 → x2 ≥ 0

    2 → 3x1 + 2x2 ≤ 12
    A(4, 0) 6(4) + 5(0) = 24
    4 → x2 ≥ 0

    1 → x1 + x2 ≤ 5
    B(2, 3) 6(2) + 5(3) = 27
    2 → 3x1 + 2x2 ≤ 12

    1 → x1 + x2 ≤ 5
    C (0, 5) 6(0) + 5(5) = 25
    3 → x1 ≥ 0

    The maximum value of the objective function Z = 27  occurs at the extreme point (2, 3).

    Hence, the optimal solution to the given LP problem is : x 1 = 2, x2 = 3  and max Z = 27 .

    about:blank 1/2
    2/20/2017 Graphical method

    Solution is provided by AtoZmath.com

    about:blank 2/2

    You might also like