Approximate Farkas lemmas and stopping rules for iterative infeasible-point algorithms for linear programming (Q1290596): Difference between revisions

From MaRDI portal
ReferenceBot (talk | contribs)
Changed an Item
Created claim: DBLP publication ID (P1635): journals/mp/ToddY98, #quickstatements; #temporary_batch_1731530891435
 
(2 intermediate revisions by 2 users not shown)
Property / Wikidata QID
 
Property / Wikidata QID: Q92422326 / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf01584841 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1988287493 / rank
 
Normal rank
Property / DBLP publication ID
 
Property / DBLP publication ID: journals/mp/ToddY98 / rank
 
Normal rank

Latest revision as of 22:01, 13 November 2024

scientific article
Language Label Description Also known as
English
Approximate Farkas lemmas and stopping rules for iterative infeasible-point algorithms for linear programming
scientific article

    Statements

    Approximate Farkas lemmas and stopping rules for iterative infeasible-point algorithms for linear programming (English)
    0 references
    0 references
    0 references
    28 June 1999
    0 references
    linear programming
    0 references
    Farkas lemma
    0 references
    infeasible-interior-point methods
    0 references
    stopping rules
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers