Displaying similar documents to “Paradox in a Non-Linear Capacitated Transportation Problem”

An algorithm for multiparametric min max 0-1-integer programming problems relative to the objective function

José Luis Quintero, Alejandro Crema (2005)

RAIRO - Operations Research - Recherche Opérationnelle

Similarity:

The multiparametric min max 0-1-Integer Programming (0-1-IP) problem relative to the objective function is a family of min max 0-1-IP problems which are related by having identical constraint matrix and right-hand-side vector. In this paper we present an algorithm to perform a complete multiparametric analysis relative to the objective function.

Efficient and local efficient solutions for assignment type problems

Jacques A. Ferland, Pina Marziliano (2001)

RAIRO - Operations Research - Recherche Opérationnelle

Similarity:

In this paper, we analyse the multiobjective problem generated by applying a goal programming approach to deal with linear assignment type problem. We specify sufficient conditions for a solution to be efficient for this problem. The notion of efficiency with respect to a neighborhood is also introduced and characterized through sufficient conditions. Unfortunately, these conditions are not necessary in general.

Lexicographic -robustness: an application to the 1-median problem

R. Kalaï, M. A. Aloulou, Ph. Vallin, D. Vanderpooten (2010)

RAIRO - Operations Research

Similarity:

In the last decade, several robustness approaches have been developed to deal with uncertainty. In decision problems, and particularly in location problems, the most used robustness approach rely either on maximal cost or on maximal regret criteria. However, it is well known that these criteria are too conservative. In this paper, we present a new robustness approach, called , which compensates for the drawbacks of criteria based on the worst case. We apply this approach to the 1-median...