Mathematical Programming

, Volume 6, Issue 1, pp 62–88

Validation of subgradient optimization

  • Michael Held
  • Philip Wolfe
  • Harlan P. Crowder
Article

DOI: 10.1007/BF01580223

Cite this article as:
Held, M., Wolfe, P. & Crowder, H.P. Mathematical Programming (1974) 6: 62. doi:10.1007/BF01580223

Abstract

The “relaxation” procedure introduced by Held and Karp for approximately solving a large linear programming problem related to the traveling-salesman problem is refined and studied experimentally on several classes of specially structured large-scale linear programming problems, and results on the use of the procedure for obtaining exact solutions are given. It is concluded that the method shows promise for large-scale linear programming

Copyright information

© The Mathematical Programming Society 1974

Authors and Affiliations

  • Michael Held
    • 1
  • Philip Wolfe
    • 2
  • Harlan P. Crowder
    • 2
  1. 1.IBM Systems Research InstituteNew YorkUSA
  2. 2.IBM Watson Research CenterYorktown HeightsUSA