Narrow search
Showing 1 - 10 of 27
Cover Image
Robust solutions to multi-objective linear programs with uncertain data
Goberna, M. A.; Jeyakumar, Vaithilingam; Li, Guoyin; … - In: European journal of operational research : EJOR 242 (2015) 3, pp. 730-743
Persistent link: https://www.econbiz.de/10010492433
Cover Image
Guaranteeing highly robust weakly efficient solutions for uncertain multi-objective convex programs
Goberna, M. A.; Jeyakumar, Vaithilingam; Li, Guoyin; … - In: European journal of operational research : EJOR 270 (2018) 1, pp. 40-50
Persistent link: https://www.econbiz.de/10011868899
Cover Image
The radius of robust feasibility of uncertain mathematical programs : a survey and recent developments
Goberna, Miguel A.; Jeyakumar, Vaithilingam; Li, Guoyin; … - In: European journal of operational research : EJOR 296 (2022) 3, pp. 749-763
Persistent link: https://www.econbiz.de/10013206043
Cover Image
A bilevel Farkas lemma to characterizing global solutions of a class of bilevel polynomial programs
Jeyakumar, Vaithilingam; Li, Guoyin - In: Operations research letters 43 (2015) 4, pp. 405-410
Persistent link: https://www.econbiz.de/10011372404
Cover Image
Radius of robust feasibility formulas for classes of convex programs with uncertain polynomial constraints
Goberna, M. A.; Jeyakumar, Vaithilingam; Li, G.; Linh, N. - In: Operations research letters 44 (2016) 1, pp. 67-73
Persistent link: https://www.econbiz.de/10011455576
Cover Image
A copositive Farkas lemma and minimally exact conic relaxations for robust quadratic optimization with binary and quadratic constraints
Chieu, N. H.; Chuong Thai Doan; Jeyakumar, Vaithilingam; … - In: Operations research letters 47 (2019) 6, pp. 530-536
Persistent link: https://www.econbiz.de/10012131861
Cover Image
Convexifiability of continuous and discrete nonnegative quadratic programs for gap-free duality
Chieu, N. H.; Jeyakumar, Vaithilingam; Li, Guoyin - In: European journal of operational research : EJOR 280 (2020) 2, pp. 441-452
Persistent link: https://www.econbiz.de/10012132417
Cover Image
A convergent hierarchy of SDP relaxations for a class of hard robust global polynomial optimization problems
Chieu, N. H.; Jeyakumar, Vaithilingam; Li, Guoyin - In: Operations research letters 45 (2017) 4, pp. 325-333
Persistent link: https://www.econbiz.de/10011740347
Cover Image
Constraint qualifications for convex optimization without convexity of constraints : new connections and applications to best approximation
Chieu, N. H.; Jeyakumar, Vaithilingam; Li, Guoyin; … - In: European journal of operational research : EJOR 265 (2018) 1, pp. 19-25
Persistent link: https://www.econbiz.de/10011805281
Cover Image
Convergence of the Lasserre hierarchy of SDP relaxations for convex polynomial programs without compactness
Jeyakumar, Vaithilingam; Phạm, T. S.; Li, Guoyin - In: Operations research letters 42 (2014) 1, pp. 34-40
Persistent link: https://www.econbiz.de/10010259257