1. Research Report;J.F. Bonnans,1993
2. R.M. Freund, An infeasible-start algorithm for linear programming whose complexity depends on the distance from the starting point to the optimal solution, Working Paper 3559-93-MSA, Sloan School of Management, Massachusetts Institute of Technology, Cambridge MA 02139, USA (1993).
3. Technical Reports TR92-41;C.C. Gonzaga,1992
4. O. Güler, Generalized linear complementarity problems, Research Reports, Department of Mathematics and Statistics, University of Maryland Baltimore County, Baltimore, Maryland 21228-5398, USA (1993), to appear in Mathematics of Operations Research.
5. Reports on Computational Mathematics;J. Ji,1991