Optimization Online


An Improvised Approach to Robustness in Linear Optimization

Mehdi Karimi(m7karimi***at***uwaterloo.ca)
Somayeh Moazeni(somayeh***at***princeton.edu)
Levent Tuncel(ltuncel***at***math.uwaterloo.ca)

Abstract: We treat uncertain linear programming problems by utilizing the notion of weighted analytic centers and notions from the area of multi-criteria decision making. In addition to many practical advantages, due to the flexibility of our approach, we are able to prove that the robust optimal solutions generated by our algorithms are at least as desirable to the decision maker as any solution generated by many other robust optimization algorithms. We then develop interactive cutting-plane algorithms for robust optimization, based on concave and quasi-concave utility functions. We present some probabilistic bounds for feasibility of robust solutions and evaluate our approach by means of computational experiments.

Keywords: Robust Optimization, Linear Optimization

Category 1: Robust Optimization

Category 2: Applications -- OR and Management Sciences


Download: [PDF]

Entry Submitted: 12/16/2013
Entry Accepted: 12/16/2013
Entry Last Modified: 12/16/2013

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