z-logo
Premium
Robust models for linear programming with uncertain right hand side
Author(s) -
Ouorou Adam
Publication year - 2016
Publication title -
networks
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.977
H-Index - 64
eISSN - 1097-0037
pISSN - 0028-3045
DOI - 10.1002/net.21693
Subject(s) - heuristics , cutting plane method , robust optimization , linear programming , mathematical optimization , bilinear interpolation , computer science , mathematics , algorithm , integer programming , computer vision
We propose new robust models for handling right hand side uncertainty in linear problems. A cutting plane‐like method could be devised to solve the resulting robust problems, but the subproblem to solve at each step involves a bilinear objective. Upper approximations are thus constructed based on linear decision and zero‐order rules on the adjustable variables. Tractable reformulations are given on some uncertainty sets arising in practice. Heuristics are also proposed to compute lower bounds. To assess the methodology we consider its application to the capacity assignment problem. © 2016 Wiley Periodicals, Inc. NETWORKS, Vol. 68(3), 200–211 2016

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here