1993Bulletin of the Australian Mathematical SocietyOpen access

A direct ellipsoid method for linear programming

Shiquan Wu, Fang Wu

Open full text 1 citations

Abstract

This paper indicates how to apply the ellipsoid method directly to Linear Programming problems and proves that this kind of version of the ellipsoid method is almost as good as Karmarkar's type method in the theoretical sense.

Open-access reader

About this research paper

What this paper is about

This paper indicates how to apply the ellipsoid method directly to Linear Programming problems and proves that this kind of version of the ellipsoid method is almost as good as Karmarkar's type method in the theoretical sense.

Why it matters

OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

This paper indicates how to apply the ellipsoid method directly to Linear Programming problems and proves that this kind of version of the ellipsoid method is almost as good as Karmarkar's type method in the theoretical sense.

Key concepts: Ellipsoid, Mathematics, Ellipsoid method, Linear programming, Mathematical optimization, Applied mathematics, Mathematical analysis, Geometry

Related papers

Back to paper searchBrowse research topicsOriginal source
A direct ellipsoid method for linear programming — Research Paper | ScholarLens