AN 0(ゎjCOMPLEXITY REDUCTION FOR THE LONG-STEP PATH-FOLLOWING ALGORITHM FOR LINEAR PROGRAMMING
Similar Items:
1
Technical Paper
A POTENTIAL REDUCTION VARIANT OF RENEGAR'S SHORT-STEP PATH-FOLLOWING METHOD FOR LINEAR PROGRAMMING
National Aeronautics and Space Adminstration |
National Aeronautics and Space Adminstration |
National Aeronautics and Space Adminstration |
8
Technical Paper
THE INFLUENCE OF THE POTENTIAL FUNCTION ON THER PERFORMANCE OF A TRAJECTORY FOLLOWING ALGORITHM FOR THE LINEAR PROGRAMMING PROBLEM
National Aeronautics and Space Administration |
3
Technical Paper
ON THE CLASSICAL LOGARITHMIC BARRIER FUNCTION METHOD FOR A CLASS OF SMOOTH CONVEX PROGRAMMING PROBLEMS
National Aeronautics and Space Adminstration |
9
Technical Paper
A NEW, TRAJECTORY FOLLOWING POLYNOMIAL-TIME ALGORITHM FOR THE LINEAR PROGRAMMING PROBLEM
National Aeronautics and Space Administration |
National Aeronautics and Space Adminstration |
National Aeronautics and Space Adminstration |
5
Technical Paper
PRIMAL-DUAL ALGOTITHMS FOR LINEAR PROGRAMMING BASED ON THE LOGARITHEMIC BARRIR METHOD
National Aeronautics and Space Adminstration |
National Aeronautics and Space Adminstration |
6
Technical Paper
INTERIOR-POINT METHODOLOGY FOR LINEAR PROGRAMMING: DUALITY, SENSITIVITY ANALYSIS AND COMPUTATIONAL ASPECTS
National Aeronautics and Space Adminstration |
National Aeronautics and Space Adminstration |