The simplex algorithm with the pivot rule of maximizing criterion improvement (Q2558159): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5329508 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3844775 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5547252 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A class of linear programming problems requiring a large number of iterations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4051879 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 11:26, 12 June 2024

scientific article
Language Label Description Also known as
English
The simplex algorithm with the pivot rule of maximizing criterion improvement
scientific article

    Statements

    The simplex algorithm with the pivot rule of maximizing criterion improvement (English)
    0 references
    0 references
    1973
    0 references

    Identifiers