ALBERT

All Library Books, journals and Electronic Records Telegrafenberg

X
feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
back to result list
  • 1
    Electronic Resource
    Electronic Resource
    A polynomial method of approximate centers for linear programming (1992)
    Springer
    Mathematical programming 54 (1992), S. 295-305 
    Details
    ISSN: 1436-4646
    Keywords: Interior-point method ; linear programming ; Karmarkar's method ; polynomial-time algorithm ; logarithmic barrier function ; path-following method
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract We present a path-following algorithm for the linear programming problem with a surprisingly simple and elegant proof of its polynomial behaviour. This is done both for the problem in standard form and for its dual problem. We also discuss some implementation strategies.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01586056
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...