Show simple item record

dc.contributor.authorGabrel, Virginie
dc.contributor.authorMurat, Cécile
dc.contributor.authorRemli, Nabila
dc.subjectmaximum regret criteriaen
dc.subjectrobustness analysisen
dc.subjectinterval right handsideen
dc.subjectlinear programmingen
dc.titleLinear Programming with interval right hand sidesen
dc.typeArticle accepté pour publication ou publié
dc.description.abstractenIn this paper, we study general linear programs in which right handsides are interval numbers. This model is relevant when uncertain and inaccurate factors make di±cult the assignment of a single value to each right handside. When objective function coefficients are interval numbers in a linear program, it is used to determine optimal solutions according to classical criteria coming from decision theory (like the worst case criterion). When the feasible solutions set is uncer- tain, another approach consists in determining the worst and best optimum solutions. We study the complexity of these two optimization problems when each right handside is an interval number. Moreover, we analysis the relationship between these two problems and the classical approach coming from decision theory. We exhibit some duality relation between the worst optimum solution problem and the best optimum solution problem in the dual. This study highlights some duality property in robustness analysis.en
dc.relation.isversionofjnlnameInternational Transactions in Operational Research
dc.relation.isversionofjnlpublisherWiley interscienceen
dc.subject.ddclabelRecherche opérationnelleen

Files in this item


There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record