Optimization Online


Robust Binary Optimization using a Safe Tractable Approximation

Ruken Duzgun (rud207***at***lehigh.edu)
Aurelie Thiele (aut204***at***lehigh.edu)

Abstract: We present a robust optimization approach to 0-1 linear programming with uncertain objective coefficients based on a safe tractable approximation of chance constraints, when only the first two moments and the support of the random parameters is known. We obtain nonlinear problems with only one additional (continuous) variable, for which we discuss solution techniques. The resulting robust optimization problem can be interpreted as a nominal problem with modified coefficients. We compare our approach with Bertsimas and Sim (2003). In numerical experiments, we obtain solutions of similar quality in faster time.

Keywords: Robust optimization, binary problems, chance constraints

Category 1: Robust Optimization

Citation: Technical report, Lehigh University, 2014.

Download: [PDF]

Entry Submitted: 12/01/2014
Entry Accepted: 12/01/2014
Entry Last Modified: 12/01/2014

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Optimization Society