complexity of LP
- From: Steve Borbash <sink300@xxxxxxxxxxx>
- Date: Thu, 06 Apr 2006 00:46:45 -0400
What is the state of the art in solving a linear program? I have heard of a result (from the 1980s I think) that says that the LP can be solved in time O(n^3 L) where n is the number of variables and L is the number of bits required to describe the instance. Is that still the sharpest result for the worst-case complexity?
.
- Follow-Ups:
- Re: complexity of LP
- From: Peter Spellucci
- Re: complexity of LP
- Prev by Date: Re: Using secant method to find a root x of a nonlinear equation
- Next by Date: Re: Choice of programming language
- Previous by thread: Using secant method to find a root x of a nonlinear equation
- Next by thread: Re: complexity of LP
- Index(es):
Relevant Pages
|
