On the worst case complexity of potential reduction algorithms for linear programming

Name

SWP-3558-28226978.pdf

Size

884.36 KB

Format

Adobe PDF

Checksum (MD5)

7469d419676b83eac439c6a5482e2c1b

Date Issued

1993

Publisher

Alfred P. Sloan School of Management, Massachusetts Institute of Technology

Series/Report no.

Working paper (Sloan School of Management) ; 3558-93.

Description

Includes bibliographical references (p. 16-17).

Persistent DSpace Link