Narrow search
Showing 1 - 10 of 10
Cover Image
An algorithm for single-item economic lot-sizing problem with general inventory cost, non-decreasing capacity, and non-increasing setup and production cost
Chen, Shaoxiang; Feng, Yi; Kumar, Arun; Lin, Bing - In: Operations research letters 36 (2008) 3, pp. 300-302
Persistent link: https://www.econbiz.de/10003773776
Cover Image
Exact SDP relaxations for classes of nonlinear semidefinite programming problems
Jeyakumar, V.; Li, G. - In: Operations research letters 40 (2012) 6, pp. 529-537
Persistent link: https://www.econbiz.de/10010044478
Cover Image
Characterizing robust set containments and solutions of uncertain linear programs without qualifications
Jeyakumar, V.; Li, Guoyin - In: Operations research letters 38 (2010) 3, pp. 188-194
Persistent link: https://www.econbiz.de/10003968643
Cover Image
A robust von Neumann minimax theorem for zero-sum games under bounded payoff uncertainty
Jeyakumar, V.; Li, Guoyin; Lee, G. M. - In: Operations research letters 39 (2011) 2, pp. 109-114
Persistent link: https://www.econbiz.de/10009010686
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
Cover Image
Exact SDP relaxation for classes of nonlinear semidefinite programming problems
Jeyakumar, Vaithilingam; Li, Guoyin - In: Operations research letters 40 (2012) 6, pp. 529-536
Persistent link: https://www.econbiz.de/10009717288
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
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
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