on the simplex algorithm initializing

Clicks: 7
ID: 180433
2012
Article Quality & Performance Metrics
Overall Quality
Not rated
Combines reader engagement with the AI quality analysis. This article has not been analysed, so there is no overall score — reader engagement is measured and shown alongside.
AI Quality Assessment
Not analyzed
Readership in this journal
Popular

Ranked #445 of 631 articles by views in science and technology of advanced materials

Most read Least read

Bar heights use a square-root scale. Only the 120 most-read articles are drawn; the journal has 631 in total.

Mint this article as an NFT
Not yet minted

Create a permanent, verifiable on-chain record of this article on the Scimatic Network. The NFT is held in your Journament account, and you can withdraw it to your own wallet at any time.

5 SUSD one-off · no wallet required
Abstract
This paper discusses the importance of starting point in the simplex algorithm. Three different methods for finding a basic feasible solution are compared throughout performed numerical test examples. We show that our two methods on the Netlib test problems have better performances than the classical algorithm for finding initial solution. The comparison of the introduced optimization softwares is based on the number of iterative steps and on the required CPU time. It is pointed out that on average it takes more iterations to determine the starting point than the number of iterations required by the simplex algorithm to find the optimal solution.
Reference Key
stojkovi2012abstracton Use this key to autocite in the manuscript while using SciMatic Manuscript Manager or Thesis Manager
Authors ;Nebojša V. Stojković;Predrag S. Stanimirović;Marko D. Petković;Danka S. Milojković
Journal science and technology of advanced materials
Year 2012
DOI
10.1155/2012/487870
URL
Keywords

Citations

No citations found. To add a citation, contact the admin at info@scimatic.org

No comments yet. Be the first to comment on this article.