메뉴 건너뛰기




Volumn 8, Issue 4, 1998, Pages 1038-1059

A new degeneracy method and steepest-edge-based conditioning for LP

Author keywords

Active set method; Conditioning; Degeneracy; Linear programming; Null space; Simplex method; Steepest edge method

Indexed keywords


EID: 0032358967     PISSN: 10526234     EISSN: None     Source Type: Journal    
DOI: 10.1137/S1052623494277470     Document Type: Article
Times cited : (2)

References (13)
  • 1
    • 0010651331 scopus 로고
    • A mutual primal-dual simplex method
    • R. L. Graves and P. Wolfe, eds., McGraw-Hill, New York
    • M. L. BALINSKI AND R. E. GOMORY, A mutual primal-dual simplex method, in Recent Advances in Mathematical Programming, R. L. Graves and P. Wolfe, eds., McGraw-Hill, New York, 1963, pp. 17-28.
    • (1963) Recent Advances in Mathematical Programming , pp. 17-28
    • Balinski, M.L.1    Gomory, R.E.2
  • 3
    • 0012063906 scopus 로고
    • Expected conditioning
    • R. FLETCHER, Expected conditioning, IMA J. Numer. Anal., 5 (1985), pp. 247-273.
    • (1985) IMA J. Numer. Anal. , vol.5 , pp. 247-273
    • Fletcher, R.1
  • 5
    • 38249026962 scopus 로고
    • Degeneracy in the presence of roundoff errors
    • R. FLETCHER, Degeneracy in the presence of roundoff errors, Linear Algebra Appl., 106 (1988), pp. 149-183.
    • (1988) Linear Algebra Appl. , vol.106 , pp. 149-183
    • Fletcher, R.1
  • 6
    • 21344481478 scopus 로고
    • Resolving degeneracy in quadratic programming
    • R. FLETCHER, Resolving degeneracy in quadratic programming, Ann. Oper. Res., 47 (1993), pp. 307-334.
    • (1993) Ann. Oper. Res. , vol.47 , pp. 307-334
    • Fletcher, R.1
  • 7
    • 0039545488 scopus 로고
    • Towards reliable linear programming
    • Numerical Analysis 1989, D. F. Griffiths and G. A. Watson, eds., Longman, Harlow, UK
    • R. FLETCHER AND J. A. J. HALL, Towards reliable linear programming, in Numerical Analysis 1989, Pitman Res. Notes Math. Ser. 228, D. F. Griffiths and G. A. Watson, eds., Longman, Harlow, UK, 1990, pp. 89-104.
    • (1990) Pitman Res. Notes Math. Ser. , vol.228 , pp. 89-104
    • Fletcher, R.1    Hall, J.A.J.2
  • 8
    • 0027114508 scopus 로고
    • Steepest-edge simplex algorithms for linear programming
    • J. J. FORREST AND D. GOLDFARB, Steepest-edge simplex algorithms for linear programming, Math. Programming, 57 (1992), pp. 341-374.
    • (1992) Math. Programming , vol.57 , pp. 341-374
    • Forrest, J.J.1    Goldfarb, D.2
  • 9
    • 0000726097 scopus 로고
    • A practical steepest-edge simplex algorithm
    • D. GOLDFARB AND J. K. REID, A practical steepest-edge simplex algorithm, Math. Programming, 12 (1977), pp. 361-371.
    • (1977) Math. Programming , vol.12 , pp. 361-371
    • Goldfarb, D.1    Reid, J.K.2
  • 10
    • 0039545493 scopus 로고
    • An exact update for Harris' tread
    • H. GREENBERG AND J. E. KALAN, An exact update for Harris' tread, Programming Studies, 4 (1975), pp. 26-29.
    • (1975) Programming Studies , vol.4 , pp. 26-29
    • Greenberg, H.1    Kalan, J.E.2
  • 11
    • 0028320062 scopus 로고
    • MOPS - Mathematical optimization system
    • U. H. SUHL, MOPS - Mathematical Optimization System, European J. Operational Research, 72 (1994), pp. 312-322.
    • (1994) European J. Operational Research , vol.72 , pp. 312-322
    • Suhl, U.H.1
  • 13
    • 0000238985 scopus 로고
    • A technique for resolving degeneracy in linear programming
    • P. WOLFE, A technique for resolving degeneracy in linear programming, J. Soc. Indust. Appl. Math., 11 (1963), pp. 205-211.
    • (1963) J. Soc. Indust. Appl. Math. , vol.11 , pp. 205-211
    • Wolfe, P.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.