Total Time Minimizing Transportation Problem
Ilija Nikolić (2007)
The Yugoslav Journal of Operations Research
Similarity:
Ilija Nikolić (2007)
The Yugoslav Journal of Operations Research
Similarity:
P F. Körner (1991)
Applicationes Mathematicae
Similarity:
Letizia Pellegrini (2004)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
In this paper we present the image space analysis, based on a general separation scheme, with the aim of studying lagrangian duality and shadow prices in Vector Optimization. Two particular kinds of separation are considered; in the linear case, each of them is applied to the study of sensitivity analysis, and it is proved that the derivatives of the perturbation function can be expressed in terms of vector Lagrange multipliers or shadow prices.
A. Adamski, A. Korytowski, W. Mitkowski (1977)
Applicationes Mathematicae
Similarity:
Ritu Narang, S.R. Arora (2009)
The Yugoslav Journal of Operations Research
Similarity:
J. Gauvin, R. Janin (1989)
Annales de l'I.H.P. Analyse non linéaire
Similarity:
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.
T. O. M. Kronsjö (1968)
ESAIM: Mathematical Modelling and Numerical Analysis - Modélisation Mathématique et Analyse Numérique
Similarity:
Lee, W.R., Wang, S., Teo, K.L. (1999)
Mathematical Problems in Engineering
Similarity:
Diptesh Ghosh, Gerard Sierksma (2003)
Applicationes Mathematicae
Similarity:
This paper studies the complexity of sensitivity analysis for optimal and ε-optimal solutions to general 0-1 combinatorial optimization problems with min-max objectives. Van Hoesel and Wagelmans [9] have studied the complexity of sensitivity analysis of optimal and ε-optimal solutions to min-sum problems, and Ramaswamy et al. [17] the complexity of sensitivity analysis of optimal solutions to min-max problems. We show that under some mild assumptions the sensitivity analysis of ε-optimal...
S. Rolewicz (1983)
Annales Polonici Mathematici
Similarity:
Adlakha, V., Arsham, H. (1998)
Journal of Applied Mathematics and Decision Sciences
Similarity:
Radjef, Sonia, Bibi, Mohand Ouamer (2011)
Mathematical Problems in Engineering
Similarity: