A method of Euclidean centers

Computers and Operations Research

Volumn 23, Issue 1, 1996, Pages 13-25

  Fagan, James T ^a   Falk, James E ^b  

^a U S CENSUS BUREAU   (United States)

^b George Washington University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0040647562     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/0305-0548(95)00010-J     Document Type: Article

References (14)

1. N. Karmarkar, A new polynomial-time algorithm for linear programming. Combinatorica 4, 373-395.
2. G. B. Dantzig, Linear programming. In History of Mathematical Programming - A Collection of Personal Reminiscences (J. K. Lenstra, A. H. G. Rinnooy Kan, A. Schrijver, Eds). Elsevier, New York (1991).
3. M. H. Wright, Interior methods for constrained optimization. Acta Numer. 1 (1992).
4. A. V. Fiacco and G. P. McCormick, Nonlinear Programming: Sequential Unconstrained Minimization Techniques. Wiley, New York. Republished by SIAM. Philadelphia.
5. P. Huard, Resolution of mathematical programming with non-linear constraints by the method of centers. In Nonlinear Programming (J. Abadie, Ed.). North Holland, Amsterdam.
6. G. P. McCormick, Nonlinear Programming: Theory, Algorithms, and Applications. Wiley, New York.
7. J. T. Fagan, A method of Euclidean centers for linear programming. D.Sc. Dissertation. The George Washington University, Washington DC, (1992).
8. R. T. Rockafellar, Convex Analysis. Princeton University Press. Princeton.
9. M. R. Osborne, Finite Algorithms in Optimization and Data Analysis. Wiley, New York.
10. D. G. Luenberger, Optimization by Vector Space Methods. Wiley, New York (1969).
11. S. Karlin, Mathematical Methods and Theory in Games, Programming and Economics. Addison-Wesley, Reading, MA.
12. H. D. Sherali and G. Choi, Finding the closest point to the origin in the convex hull of a discrete set of points. Computers Opers Res. 4, 363-370.
13. P. Wolfe. The simplex method for quadratic programming. Econometrica 27, 382-398.
14. V. Klee, Polytope pairs and relationships to linear programming. Acta Mathematica 133, 1-25.