On a bicriteria optimal production plan
The paper presents a natural application of multi-objective programming to household production and consumption theory. A contribution to multi-objective programming theory is also included.
We consider a multiobjective optimization problem with a feasible set defined by inequality and equality constraints such that all functions are, at least, Dini differentiable (in some cases, Hadamard differentiable and sometimes, quasiconvex). Several constraint qualifications are given in such a way that generalize both the qualifications introduced by Maeda and the classical ones, when the functions are differentiable. The relationships between them are analyzed. Finally, we give several Kuhn-Tucker...
We consider a multiobjective optimization problem with a feasible set defined by inequality and equality constraints such that all functions are, at least, Dini differentiable (in some cases, Hadamard differentiable and sometimes, quasiconvex). Several constraint qualifications are given in such a way that generalize both the qualifications introduced by Maeda and the classical ones, when the functions are differentiable. The relationships between them are analyzed. Finally, we give several Kuhn-Tucker...
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.
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.
Sufficient conditions are given for the global Pareto solution of the multicriterial optimization problem to be in a given convex subset of the domain. In the case of maximizing real valued-functions, the conditions are sufficient and necessary without any convexity type assumptions imposed on the function. In the case of linearly scalarized vector-valued functions the conditions are sufficient and necessary provided that both the function is concave and the scalarization is increasing with respect...
In this paper we investigate the lower Lipschitz continuity of minimal points of an arbitrary set A depending upon a parameter u . Our results are formulated with the help of the modulus of minimality. The crucial requirement which allows us to derive sufficient conditions for lower Lipschitz continuity of minimal points is that the modulus of minimality is at least linear. The obtained results can be directly applied to stability analysis of vector optimization problems.
The connectivity of the efficient point set and of some proper efficient point sets in locally convex spaces is investigated.
This paper deals with a multiobjective control problem for nonlinear discrete time systems. The problem consists of finding a control strategy which minimizes a number of performance indexes subject to state and control constraints. A solution to this problem through the Receding Horizon approach is proposed. Under standard assumptions, it is shown that the resulting control law guarantees closed-loop stability. The proposed method is also used to provide a robustly stabilizing solution to the problem...