In this note we analyze the simultaneous preservation of the consistency (and of the inconsistency) of linear programming problems posed in infinite dimensional Banach spaces, and their corresponding dual problems, under sufficiently small perturbations of the data. We consider seven different scenarios associated with the different possibilities of perturbations of the data (the objective functional, the constraint functionals, and the right hand-side function), i.e., which of them are known, and remain fixed, and which ones can be perturbed because of their uncertainty. The obtained results allow us to give sufficient and necessary conditions for the coincidence of the optimal values of both problems and for the stability of the duality g...
In this article, some sensitivity analysis of the dual optimal value in linear semi-infinite optimiz...
AbstractIn this paper, we consider a primal–dual infinite linear programming problem-pair, i.e. LPs ...
In this article, we consider the space of all the linear semi-infinite programming (LSIP) problems w...
In this note we analyze the simultaneous preservation of the consistency (and of the inconsistency) ...
Any linear (ordinary or semi-infinite) optimization problem, and also its dual problem, can be class...
AbstractWe study the infinite dimensional linear programming problem. The previous work done on this...
This paper examines a few relations between solution characteristics of an LP and the amount by whic...
This paper concerns applications of advanced techniques of variational analysis and generalized diff...
AbstractIn this paper duality theory for infinite dimensional linear programs is discussed in a topo...
In this chapter primal and dual abstract linear programming problems are considered. The possibility...
Artículo de publicación ISIThis paper studies stability properties of linear optimization problems w...
In this paper, we apply the concept of coderivative and other tools from the generalized differentia...
ABSTRACT: We study a problem of linear programming in the setting of a vector space over a linearly ...
AbstractLinear semi-infinite programming deals with the optimization of linear functionals on finite...
We consider the class of linear programs with infinitely many variables and constraints having the p...
In this article, some sensitivity analysis of the dual optimal value in linear semi-infinite optimiz...
AbstractIn this paper, we consider a primal–dual infinite linear programming problem-pair, i.e. LPs ...
In this article, we consider the space of all the linear semi-infinite programming (LSIP) problems w...
In this note we analyze the simultaneous preservation of the consistency (and of the inconsistency) ...
Any linear (ordinary or semi-infinite) optimization problem, and also its dual problem, can be class...
AbstractWe study the infinite dimensional linear programming problem. The previous work done on this...
This paper examines a few relations between solution characteristics of an LP and the amount by whic...
This paper concerns applications of advanced techniques of variational analysis and generalized diff...
AbstractIn this paper duality theory for infinite dimensional linear programs is discussed in a topo...
In this chapter primal and dual abstract linear programming problems are considered. The possibility...
Artículo de publicación ISIThis paper studies stability properties of linear optimization problems w...
In this paper, we apply the concept of coderivative and other tools from the generalized differentia...
ABSTRACT: We study a problem of linear programming in the setting of a vector space over a linearly ...
AbstractLinear semi-infinite programming deals with the optimization of linear functionals on finite...
We consider the class of linear programs with infinitely many variables and constraints having the p...
In this article, some sensitivity analysis of the dual optimal value in linear semi-infinite optimiz...
AbstractIn this paper, we consider a primal–dual infinite linear programming problem-pair, i.e. LPs ...
In this article, we consider the space of all the linear semi-infinite programming (LSIP) problems w...