An exterior-point polytope sliding and deformation algorithm for linear programming problems

Informatica

Volumn 8, Issue 4, 1997, Pages 559-582

  Sherali, Hanif D ^a   Choi, Gyunghyun ^a   Sen, Suvrajeet ^b  

^a VIRGINIA POLYTECHNIC INSTITUTE AND STATE UNIVERSITY   (United States)

^b University of Arizona   (United States)

Author keywords

Exterior point method; Karmarkar's algorithm; Linear programming

Indexed keywords

EID: 0004542132     PISSN: 08684952     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (10)

1. Bazaraa, M.S., J.J. Jarvis and H.D. Sherali (1990). Linear Programming and Network Flows, Second edition. John Wiley and Sons, Inc., New York, NY.
2. Bazaraa, M.S., H.D. Sherali and C.M. Shetty (1993). Nonlinear Programming: Theory and Algorithms, Second edition. John Wiley and Sons, Inc., New York, NY.
3. Gacs, P., and L. Lovasz (1981). Khachian's algorithm for linear programming. Mathematical Programming Study, 14, 61-68.
4. Karmarkar, N. (1984). A new polynomial-time algorithm for linear programming. Combinatorica, 4, 373-395.
5. Parker, G.R., and R.L. Rardin (1988). Discrete Optimization. Academic Press, Inc., San Diego, CA 92101.
6. Rosen, J., and S. Suzuki (1965). Construction of nonlinear programming test problems. Communications of the ACM, 8.
7. Sherali, H.D., and G. Choi (1993). Finding the closest point to the origin in the convex hull of a discrete set of points. Computers and Operations Research, 20(4), 363-370.
8. Sherali, H.D., and D.L. Myers (1988). Dual formulations and subgradient optimization strategies for linear programming relaxations of mixed-integer programs. Discrete Applied Mathematics, 20, 51-68.
9. Tomlin, J.A. (1985). An Experimental Approach to Karmarkar's Projective Method for Linear Programming. Ketron, Inc., Mountain View, CA 94040.
10. Wolfe, P. (1976). Finding the nearest point in a polytope. Mathematical Programming, 11, 128-149.