Article View: sci.op-research
Article #28Re: Linear inequality and linear programming
From: Arthur L. Rubin
Date: Thu, 17 Dec 1998 00:00
Date: Thu, 17 Dec 1998 00:00
23 lines
1681 bytes
1681 bytes
Dima Pasechnik wrote: > > Ronald Hui <ronhui@hkpc.org> writes: > > > If I have a linear inequality system for a set of variables xi, how can > > I find one solution that can satisfy the linear inequality constraint? > > > > I think linear programming is a possible method. But is there any faster > > and easier method? > In general, nothing faster is known. > > Dmitrii I think the ellipsoid method has been shown to be faster than the simplex method is guaranteed to be, but, in practice, the simplex method is actually the fastest method. (These are both linear programming methods, but I assume Mr. Hui was using "linear programming" to denote the simplex method.) -- Arthur L. Rubin 216-5888@mcimail.com
Technical Details
Message-ID:
<3677F039.5132@mcimail.com>Path:
arc1-ca.pugleaf.net!unknown!not-for-mailReferences:
<3677D0AE.C8802279@hkpc.org> <t3hfuvx5tc.fsf@duti515a.twi.tudelft.nl>Show Full Headers
Complete Article Headers
X-Google-Language: ENGLISH,ASCII-7-bit X-Google-Thread: fcea6,b0930d54129db298 X-Google-Attributes: gidfcea6,public X-Google-Thread: 10a1dc,b0930d54129db298 X-Google-Attributes: gid10a1dc,public X-Google-Thread: f4956,b0930d54129db298 X-Google-Attributes: gidf4956,public X-Google-Thread: 109d8a,b0930d54129db298 X-Google-Attributes: gid109d8a,public From: "Arthur L. Rubin" <216-5888@mcimail.com> Subject: Re: Linear inequality and linear programming Date: 1998/12/17 Message-ID: <3677F039.5132@mcimail.com> X-Deja-AN: 423201641 Content-Transfer-Encoding: 7bit References: <3677D0AE.C8802279@hkpc.org> <t3hfuvx5tc.fsf@duti515a.twi.tudelft.nl> X-Posted-Path-Was: not-for-mail Content-Type: text/plain; charset=us-ascii X-ELN-Date: 17 Dec 1998 08:02:57 GMT X-ELN-Insert-Date: Thu Dec 17 01:45:08 1998 Organization: EarthLink Network, Inc. Mime-Version: 1.0 Newsgroups: sci.op-research,sci.misc,fj.sci.math,sci.math