Algebraic simplex initialization combined with the nonfeasible basis method (Q319588): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 5 users not shown)
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C05 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C49 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6633595 / rank
 
Normal rank
Property / zbMATH Keywords
 
linear programming
Property / zbMATH Keywords: linear programming / rank
 
Normal rank
Property / zbMATH Keywords
 
simplex algorithm
Property / zbMATH Keywords: simplex algorithm / rank
 
Normal rank
Property / zbMATH Keywords
 
nonfeasible basis method
Property / zbMATH Keywords: nonfeasible basis method / rank
 
Normal rank
Property / zbMATH Keywords
 
formal tableau
Property / zbMATH Keywords: formal tableau / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: MarPlex / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ejor.2015.03.040 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1985180758 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4079613 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The \(s\)-monotone index selection rules for pivot algorithms of linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5808752 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3844775 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A practicable steepest-edge simplex algorithm / 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 overview on the simplex algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4522255 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new efficient primal dual simplex algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two direct methods in linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4693067 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The many facets of linear programming / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 15:41, 12 July 2024

scientific article
Language Label Description Also known as
English
Algebraic simplex initialization combined with the nonfeasible basis method
scientific article

    Statements

    Algebraic simplex initialization combined with the nonfeasible basis method (English)
    0 references
    0 references
    0 references
    6 October 2016
    0 references
    linear programming
    0 references
    simplex algorithm
    0 references
    nonfeasible basis method
    0 references
    formal tableau
    0 references

    Identifiers