Scribd Logo
Upload

Welcome to Scribd!

  • 42 views

    Sheet 3 PDF

    Uploaded by

    Iniyan I T
    This document discusses linear programming optimization techniques, including: 1) Graphically solving linear programs with multiple constraints to determine feasible regions and optimal objective values 2) Corresponding extreme points of the feasible region to basic feasible solutions 3) Finding all basic feasible solutions and optimal solutions by solving systems of equations for two sample problems.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd

    Sheet 3 PDF

    Uploaded by

    Iniyan I T
    42 views1 page
    This document discusses linear programming optimization techniques, including: 1) Graphically solving linear programs with multiple constraints to determine feasible regions and optimal objective values 2) Corresponding extreme points of the feasible region to basic feasible solutions 3) Finding all basic feasible solutions and optimal solutions by solving systems of equations for two sample problems.

    Original Title

    Sheet 3.pdf

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    This document discusses linear programming optimization techniques, including: 1) Graphically solving linear programs with multiple constraints to determine feasible regions and optimal objective values 2) Corresponding extreme points of the feasible region to basic feasible solutions 3) Finding all basic feasible solutions and optimal solutions by solving systems of equations for two sample problems.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    42 views1 page

    Sheet 3 PDF

    Uploaded by

    Iniyan I T
    This document discusses linear programming optimization techniques, including: 1) Graphically solving linear programs with multiple constraints to determine feasible regions and optimal objective values 2) Corresponding extreme points of the feasible region to basic feasible solutions 3) Finding all basic feasible solutions and optimal solutions by solving systems of equations for two sample problems.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    You are on page 1of 1

    Indian Institute of Technology Roorkee

    Optimization Techniques (MAN-010)

    Exercise – 3
    1. Consider the graphical representations of the following linear program:
    Maximize (or minimize) z = 5x1 + 3x 2
    Subject to x1 + x 2 ≤ 6 , x1 ≥ 3 , x 2 ≥ 3 , 2x1 + 3x 2 ≥ 3 , x1 , x 2 ≥ 0.

    (a) In each of the following cases indicate if the feasible region has one point, infinite
    number of points, or no point.
    (i) The constraints are as given above. (one)
    (ii) The constraint x1 + x 2 ≤ 6 is changed to x1 + x 2 ≤ 5 .. (none)
    (iii) The constraint x1 + x 2 ≤ 6 is changed to x1 + x 2 ≤ 7 . (infinite)

    (b) For each case in (a) , determine the number of feasible extreme points, if any.
    (one, none, three)
    (c) For the cases in (a) in which a feasible solution exists, determine the maximum and
    minimum values of z and their associated extreme points
    ( Max z = 24 = min z , min z = 24, max z = 29).
    2. Solve graphically
    (i) Maximize (and minimize) z = 10x1 + 8x 2
    Subject to x1 + x 2 ≥ 2 , 4x1 + 5x 2 ≤ 20 , 5x1 + 4x 2 ≤ 20 , x1 , x 2 ≥ 0.
    (ii) Maximize z = 3x1 + 4x 2
    Subject to x1 + 2x 2 ≤ 6 , x1 − 2x 2 ≤ 3 , 2x1 − x 2 ≥ − 2 , x1 ≤ 4 , x1 ≥ 0.

    3. Consider the following problem:


    Maximize z = − 4x1 + 6x 2 , s / t 2x1 − 3x 2 ≥ − 6 , − x1 + x 2 ≤1, x1 , x 2 ≥ 0 .
    Show graphically that the variables x 1 and x 2 can be increased indefinitely while the
    optimal value of the objective function remains constant.

    4. Show graphically that the following problem has unbounded solution


    Maximize z = 3x1 + 4x 2 , s / t 2x1 − 3x 2 ≤ 6 , x1 ≤ 5 , x1 , x 2 ≥ 0 .

    5. Show the correspondence between extreme point and basic feasible solutions of the
    following problems:
    (i) Maximize z = 3x1 + 4x 2
    Subject to x1 + 2x 2 ≤ 8 , 3x1 + 2x 2 ≤ 12 , x1 , x 2 ≥ 0 .
    (ii) Maximize z = 3x 1 + 4x 2
    Subject to x1 + 2x 2 ≤ 4 , 3x1 + 2x 2 ≤12 , x1 , x 2 ≥ 0 .

    6. Find all basic feasible solutions and hence optimal solutions for the problems:
    (i) Maximize z = 3x1 + 2x 2 − x 4
    Subject to x 1 + 2x 2 + 2x 3 = 4 , 3x 1 − x 2 + 6x 3 + x 4 = 5 , x 1 , x 2 , x 3 , x 4 ≥ 0 .
    (ii) Maximize z = x 1 − 2x 2 + 3x 3
    Subject to
    2x 1 + 2x 2 + 2x 3 + x 4 = 6 , 4x 1 + 5x 2 + 2x 3 + 2x 3 =12 , x 1 , x 2 , x 3 , x 4 ≥ 0 .

    You might also like