A class of “onto” multifunctions

B. Curtis Eaves1, Uriel G. Rothblum2
1Dept. of Operations Research, Stanford University, Stanford, USA
2Faculty of Industrial Engineering and Management, Technion - Israel Institute of Technology, Haifa, Israel

Tóm tắt

Từ khóa


Tài liệu tham khảo

R. Bapat and T.E.S. Raghavan, “An extension of a theorem of Darroach and Ratcliff in loglinear models and its application to scaling multidimensional matrices,”Linear Algebra and its Applications 114/115 (1989) 705–715.

B.C. Eaves, “A short course solving equations with PL homotopies,”SIAM—AMS Proceedings 9 (1976) 73–145.

B.C. Eaves, “A course in triangulations for solving equations with deformations,”Lecture Notes in Economics and Mathematical Systems No. 23 (Springer, Berlin, 1984).

M. Hirsch, C.H. Papadimitriou and S.A. Vavasis, “Exponential lower bounds for finding Brouwer fixed points,” (1988), submitted to:Journal of Complexity.

M.W. Hirsh, “A proof of the nonretractability of a cell onto its boundary,”Proceedings of the AMS 14 (1963) 364–365.

F.P. Kelly,Reversibility and Stochastic Networks (Wiley, New York, 1979).

V. Mehrotra, “An approximation procedure for general closed multiclass queuing networks with deterministic routing,” Ph.D. Dissertation, Department of Operations Research, Stanford University (Stanford, CA, 1992), to be submitted.

J. Renegar, “Rudiments of an average case complexity theory for piecewise-linear path following algorithms,”Mathematical Programming 40 (1988) 113–163.

R.T. Rockafellar,Convex Analysis (Princeton University Press, Princeton, NJ, 1970).