54 citations · 90 across the 4 of their papers we have counts for
Showing math.OCShow all
3 papers · 1 filter
math.OC2014
Robust Solutions to Multi-Objective Linear Programs with Uncertain Data
M. A. Goberna, V. Jeyakumar, G. Li +1
In this paper we examine multi-objective linear programming problems in the face of data uncertainty both in the objective function and the constraints. First, we derive a formula…
math.OC2013★ 26 cited
SDP Duals without Duality Gaps for a Class of Convex Minimax Programs
V. Jeyakumar, J. Vicente-Perez
In this paper we introduce a new dual program, which is representable as a semi-definite linear programming problem, for a primal convex minimax programming model problem and show…
math.OC2013★ 54 cited
Robust SOS-Convex Polynomial Programs: Exact SDP Relaxations
V. Jeyakumar, G. Li, J. Vicente-Perez
This paper studies robust solutions and semidefinite linear programming (SDP) relaxations of a class of convex polynomial programs in the face of data uncertainty. The class of con…