Characterizing robust set containments and solutions of uncertain linear programs without qualifications (Q974991): Difference between revisions

From MaRDI portal
m rollbackEdits.php mass rollback
Tag: Rollback
Created claim: DBLP publication ID (P1635): journals/orl/JeyakumarL10, #quickstatements; #temporary_batch_1731462974821
 
(3 intermediate revisions by 3 users not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.orl.2009.12.004 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1977558040 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q59241552 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Duality in robust optimization: Primal worst equals dual best / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extending scope of robust optimization: comprehensive robust counterparts of uncertain problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3182207 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust Convex Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust solutions of uncertain linear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust optimization-methodology and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust linear optimization under general norms. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introduction to Stochastic Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scenario optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust Solutions to Least-Squares Problems with Uncertain Data / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dual characterizations of set containments with strict convex inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the stable containment of two sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3141900 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2724100 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizing Set Containments Involving Infinite Convex Constraints and Reverse-Convex Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Farkas' lemma for separable sublinear inequalities without qualifications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonsmooth vector functions and continuous optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Knowledge-based semidefinite linear programming classifiers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5852066 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Set containment characterization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5638112 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some convex programs without a duality gap / rank
 
Normal rank
Property / DBLP publication ID
 
Property / DBLP publication ID: journals/orl/JeyakumarL10 / rank
 
Normal rank

Latest revision as of 03:04, 13 November 2024

scientific article
Language Label Description Also known as
English
Characterizing robust set containments and solutions of uncertain linear programs without qualifications
scientific article

    Statements

    Characterizing robust set containments and solutions of uncertain linear programs without qualifications (English)
    0 references
    0 references
    0 references
    8 June 2010
    0 references
    robust optimization
    0 references
    uncertain linear programming
    0 references

    Identifiers