Scribd Logo
Upload

Welcome to Scribd!

  • 21 views

    KARMARKAR's Projective Scaling Method - Report

    Uploaded by

    jayroldparcede
    Linear programming method using projective scaling method by karmarkars. A ppt presentation in partial fullfilment of the MS Math linear programming course at CSU.

    Copyright:

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

    KARMARKAR's Projective Scaling Method - Report

    Uploaded by

    jayroldparcede
    21 views6 pages
    Linear programming method using projective scaling method by karmarkars. A ppt presentation in partial fullfilment of the MS Math linear programming course at CSU.

    Original Title

    KARMARKAR’s Projective Scaling Method_report

    Copyright

    © © All Rights Reserved

    Available Formats

    PPTX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Linear programming method using projective scaling method by karmarkars. A ppt presentation in partial fullfilment of the MS Math linear programming course at CSU.

    Copyright:

    © All Rights Reserved
    Download as PPTX, PDF, TXT or read online from Scribd
    Download as pptx, pdf, or txt
    21 views6 pages

    KARMARKAR's Projective Scaling Method - Report

    Uploaded by

    jayroldparcede
    Linear programming method using projective scaling method by karmarkars. A ppt presentation in partial fullfilment of the MS Math linear programming course at CSU.

    Copyright:

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

    Reporter:

    THEA ALMIRA O. MANLIGUIS




    First, is that the linear program has a
    strictly feasible point, and that the
    set of optimal points is bounded.




    Second, is that the linear program
    has a special canonical form:




    Third, is that the value of the
    objective at the optimum is
    known, and is equal to zero.


    Karmarkars algorithm starts at an interior feasible point.
    At each iteration of the algorithm:

    i. The problem is transformed via a projective transformation, to obtain an
    equivalent problem in transformed space,(click here)
    ii. A projected steepest-descent direction is computed,
    iii. A step is taken along this direction, and
    iv. The resulting point is mapped back to the original space.
    The discussion of each steps will be discuss by ARMEL MENSURADO. Click hereKARMARKARS ALGO!

    You might also like