On Chubanov's method for Linear Programming

Mathematics – Optimization and Control

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Scientific paper

We discuss the method recently proposed by S. Chubanov for the linear feasibility problem. We present new, concise proofs and interpretations of some of his results. We then show how our proofs can be used to find strongly polynomial time algorithms for special classes of linear feasibility problems. Under certain conditions, these results provide new proofs of classical results obtained by Tardos, and Vavasis and Ye.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

On Chubanov's method for Linear Programming does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On Chubanov's method for Linear Programming, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On Chubanov's method for Linear Programming will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-644157

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.