Robust optimal solutions in interval linear programming with forall-exists quantifiers

Milan Hladík

European Journal of Operational Research, 2016, vol. 254, issue 3, 705-714

Abstract: We introduce a novel kind of robustness in linear programming. A solution x* is called robust optimal if for all realizations of the objective function coefficients and the constraint matrix entries from given interval domains there are appropriate choices of the right-hand side entries from their interval domains such that x* remains optimal. We propose a method to check for robustness of a given point, and also recommend how a suitable candidate can be found. We discuss topological properties of the robust optimal solution set, too. We illustrate applicability of our concept in transportation and nutrition problems. Since not every problem has a robust optimal solution, we introduce also a concept of an approximate robust solution and develop an efficient method; as a side effect, we obtain a simple measure of robustness.

Keywords: Linear programming; Robust optimization; Interval analysis (search for similar items in EconPapers)
Date: 2016
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S037722171630251X
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:ejores:v:254:y:2016:i:3:p:705-714

DOI: 10.1016/j.ejor.2016.04.032

Access Statistics for this article

European Journal of Operational Research is currently edited by Roman Slowinski, Jesus Artalejo, Jean-Charles. Billaut, Robert Dyson and Lorenzo Peccati

More articles in European Journal of Operational Research from Elsevier
Bibliographic data for series maintained by Catherine Liu ().