Research article · 2016
Review articlePublished 2012
On Some Polynomial-time Algorithms for Solving Linear Programming Problems
Abstract
Select any words in the title or abstract, or press this and choose a sentence.
In this article we survey some Polynomial-time Algorithms for Solving Linear Programming Problems namely: the ellipsoid method, Karmarkar’s algorithm and the affine scaling algorithm. Finally, we considered a test problem which we solved with the methods where applicable and conclusions drawn from the results so obtained.
Subjects
Computer Science & ITAsk about this article
Answers come only from this article's title, abstract and keywords, each sentence pointing to where it comes from. Your question is sent to OpenAI to write the answer. Scholars Central does not store it.
Similar by topic
Research article · Jun 2012
EFFICIENT GENETIC ALGORITHM ON LINEAR PROGRAMMING PROBLEM FOR FITTEST CHROMOSOMES
Review article · 2011
Comparative study of certain numerical algorithms for solving non linear equations
Brief report · 27 Feb 2025
Hybrid Optimization Algorithms For Solving Complex Nonlinear Problems
Opinion · 7 Mar 2023
Unraveling the Magic of Algorithms: The Key to Solving Complex Problems
More from this journal
The newest in Advances in Applied Science Research.
Article · 30 Jan 2025
Exploring the Depths of Biological Sciences
Article · 21 Jan 2025
Enhancing Home Security through an Android-based Door Security System Using IoT Technology
Article · 21 Jan 2025
Systematical Method for Zero-Energy Efficiency Buildings
Follow
New articles from what you follow go into your email digest, once you agree to alert emails.
- JournalAdvances in Applied Science Research
- SubjectComputer Science & IT
- BylineArticles whose byline prints “B. O. Adejo”
- BylineArticles whose byline prints “H. S. Adaji”
