A comparison of interval linear programming with the simplex method (Q1154389): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Q1154387 / rank
Normal rank
 
Property / author
 
Property / author: Eldon A. Gunn / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q114852105 / 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/0024-3795(81)90016-1 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2033961798 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A suboptimization method for interval linear programming: A new method for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A primal algorithm for interval linear-programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5567241 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4673630 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 11:43, 13 June 2024

scientific article
Language Label Description Also known as
English
A comparison of interval linear programming with the simplex method
scientific article

    Statements

    A comparison of interval linear programming with the simplex method (English)
    0 references
    0 references
    0 references
    1981
    0 references
    interval linear programming
    0 references
    simplex method
    0 references
    comparison of algorithms
    0 references
    computational study
    0 references

    Identifiers