Scribd Logo
Upload

Welcome to Scribd!

  • Lagrange Multipliers Results

    Uploaded by

    Steven G. Verghese
    7 views1 page
    Problem I of the Lagrange Multiplier Method document finds three optimal points: a saddle point at (0,0), a maximum point at (√3/2, √3/2), and a minimum point at (√3/2, -√3/2). Problem II finds four optimal points: two maximum points at (0,0) and (2,0), and two minimum points at (1/√3, -√2/3) and (1/√3, √2/3). Problem III finds four optimal points: two maximum points at (-1,0) and (1,0), and two minimum points at (√3/10, -

    Original Description:

    Original Title

    lagrange_multipliers_results

    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
    Problem I of the Lagrange Multiplier Method document finds three optimal points: a saddle point at (0,0), a maximum point at (√3/2, √3/2), and a minimum point at (√3/2, -√3/2). Problem II finds four optimal points: two maximum points at (0,0) and (2,0), and two minimum points at (1/√3, -√2/3) and (1/√3, √2/3). Problem III finds four optimal points: two maximum points at (-1,0) and (1,0), and two minimum points at (√3/10, -

    Copyright:

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

    Lagrange Multipliers Results

    Uploaded by

    Steven G. Verghese
    Problem I of the Lagrange Multiplier Method document finds three optimal points: a saddle point at (0,0), a maximum point at (√3/2, √3/2), and a minimum point at (√3/2, -√3/2). Problem II finds four optimal points: two maximum points at (0,0) and (2,0), and two minimum points at (1/√3, -√2/3) and (1/√3, √2/3). Problem III finds four optimal points: two maximum points at (-1,0) and (1,0), and two minimum points at (√3/10, -

    Copyright:

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

    Lagrange Multiplier Method - Results

    Problem I
     √ 
    3 3
    Optimal values in both cases: (x1 , y1) = (0, 0) (saddle point), (x2 , y2 ) = ,
    2 2
    (maximum point),
     √ 
    3 3
    (x3 , y3) = 2
    , − 2
    (minimum point)

    Problem II

    Optimal values
     in
    √ 
    both cases: (x1 , y1) = (0, 0) (maximum
     √  point), (x2 , y2 ) = (2, 0) (maximum point),
    1
    (x3 , y3) = 2 , − 2 (minimum point), (x4 , y4 ) = 21 , 23 (minimum point)
    3

    Problem III

    Optimal values:
     (x , y ) = (−1, 0) (maximum point),
    √ 1 1  (x√2 , y2 ) = (1, 0) (maximum point),
    3 91 3
    (x3 , y3) = 10 , − 10 (minimum point), (x4 , y4 ) = 10 , 1091 (minimum point)

    Problem IV

    Lab worksheet nr. 10

    Problem V

    L = 4 cm, W = 3 cm, H = 3 cm

    Problem VI

    Optimal values: (x1 , y1 ) = (10, −6) (maximum point), (x2 , y2 ) = (−10, 6) (minimum point)

    Problem VII

    Optimal values: (x1 , y1 , z1 ) = (1, 0, 0) (saddle point), (x2 , y2 , z2 ) = (0, 1, 0) (saddle point),
    (x3 , y3, z3 ) = (0, 0, 1) (saddle point), (x4 , y4 , z4 ) = ( 31 , 31 , 31 ) (maximum point)

    Problem VIII

    Optimal values: (x1 , y1 ) = (0, −2) (maximum point), (x2 , y2) = (0, 2) (maximum point),
    (x3 , y3) = (−2, 0) (minimum point), (x4 , y4 ) = (2, 0) (minimum point),
    (x5 , y5) = (0, 0) (minimum point)

    Problem IX
     
    Optimal values: (x1 , y1 , z1 ) = − √213 , √313 , − √713 − 2 (maximum point),
     
    (x2 , y2, z2 ) = √2 , − √3 , √7 − 2 (minimum point)
    13 13 13

    You might also like