On the simplex algorithm initializing (Q1938217): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1155/2012/487870 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2059146830 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stabilization of Mehrotra's primal-dual algorithm and its implementation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3153265 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two direct methods in linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: The most-obtuse-angle row pivot rule for achieving dual feasibility: A computational study / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple direct cosine simplex algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5757142 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on ``An improved initial basis for the simplex algorithm'' / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved initial basis for the simplex algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: An overview on the simplex algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4693067 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modification and implementation of two-phase simplex method / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Finite Pivoting Rules for the Simplex Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3944346 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear programming. Foundations and extensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Benchmarking optimization software with performance profiles. / rank
 
Normal rank

Latest revision as of 03:43, 6 July 2024

scientific article
Language Label Description Also known as
English
On the simplex algorithm initializing
scientific article

    Statements

    On the simplex algorithm initializing (English)
    0 references
    4 February 2013
    0 references
    Summary: This paper discusses the importance of a 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.
    0 references
    linear programming
    0 references
    optimization algorithms
    0 references
    simplex algorithm
    0 references
    mathematical software \texttt{MarPlex}
    0 references

    Identifiers