NDLTD Global ETD Search
  • Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 1
  • Tagged with
  • 1
  • 1
  • 1
  • 1
  • 1
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.

Search results

Showing 1 to 1 of 1 (0.051 seconds)

Spelling suggestions: "subject:"228 .414 no.3559-, 93"" "subject:"228 .m414 no.3559-, 93""

1

An infeasible-start algorithm for linear programming whose complexity depends on the distance from the starting point to the optimal solution

January 1993 (has links)
Robert M. Freund. / Includes bibliographical references. / Supported in part by the MIT-NTU Collaboration Agreement.
HD28 .M414 no.3559-, 93

Page generated in 0.055 seconds