The search session has expired. Please query the service again.
Displaying 81 –
100 of
108
Fractional programming consists in optimizing a ratio of
two functions subject to some constraints. Different versions of this
model, linear or nonlinear, have applications in various fields like
combinatorial optimization, stochastic programming, data bases, and
economy. Three resolution methods are presented: direct solution,
parametric approach and solution of an equivalent problem.
Based on conjugate duality we construct several gap functions for general variational inequalities and equilibrium problems, in the formulation of which a so-called perturbation function is used. These functions are written with the help of the Fenchel-Moreau conjugate of the functions involved. In case we are working in the convex setting and a regularity condition is fulfilled, these functions become gap functions. The techniques used are the ones considered in [Altangerel L., Boţ R.I., Wanka...
The purpose of this paper is to apply second order -approximation method introduced to optimization theory by Antczak [2] to obtain a new second order -saddle point criteria for vector optimization problems involving second order invex functions. Therefore, a second order -saddle point and the second order -Lagrange function are defined for the second order -approximated vector optimization problem constructed in this approach. Then, the equivalence between an (weak) efficient solution of the...
In this paper, by using the second order -approximation method introduced by Antczak [3], new saddle point results are obtained for a nonlinear mathematical programming problem involving second order invex functions with respect to the same function . Moreover, a second order -saddle point and a second order -Lagrange function are defined for the so-called second order -approximated optimization problem constructed in this method. Then, the equivalence between an optimal solution in the original...
A second order optimality condition for multiobjective optimization with a set constraint is
developed; this condition is expressed as the impossibility of nonhomogeneous linear systems.
When the constraint is given in terms of inequalities and equalities, it can be turned into
a John type multipliers rule, using a nonhomogeneous Motzkin Theorem of the Alternative. Adding weak
second order regularity assumptions, Karush, Kuhn-Tucker type conditions are therefore deduced.
We examine new second-order necessary conditions and sufficient conditions which characterize nondominated solutions of a generalized constrained multiobjective programming problem. The vector-valued criterion function as well as constraint functions are supposed to be from the class . Second-order optimality conditions for local Pareto solutions are derived as a special case.
Il est démontré par Mentagui [ESAIM : COCV 9 (2003) 297-315] que, dans le cas des espaces de Banach généraux, la convergence d’Attouch-Wets est stable par une classe d’opérations classiques de l’analyse convexe, lorsque les limites des suites d’ensembles et de fonctions satisfont certaines conditions de qualification naturelles. Ceci tombe en défaut avec la slice convergence. Dans cet article, nous établissons des conditions de qualification uniformes assurant la stabilité de la slice convergence...
Il est démontré par Mentagui [ESAIM: COCV9 (2003) 297-315] que,
dans le cas des espaces de Banach généraux, la convergence
d'Attouch-Wets est stable par une classe d'opérations classiques de
l'analyse convexe, lorsque les limites des suites d'ensembles et de
fonctions satisfont certaines conditions de qualification naturelles. Ceci
tombe en défaut avec la slice convergence. Dans cet article, nous
établissons des conditions de qualification uniformes assurant la
stabilité de la slice convergence...
A special class of generalized Nash equilibrium problems is studied. Both variational and quasi-variational inequalities are used to derive some results concerning the structure of the sets of equilibria. These results are applied to the Cournot oligopoly problem.
The numerical modeling of the fully developed Poiseuille flow of a newtonian fluid in a square section with slip yield boundary condition at the wall is presented. The stick regions in outer corners and the slip region in the center of the pipe faces are exhibited. Numerical computations cover the complete range of the dimensionless number describing the slip yield effect, from a full slip to a full stick flow regime. The resolution of variational inequalities describing the flow is based on the...
The numerical modeling of the fully developed Poiseuille flow
of a Newtonian fluid in a square section with
slip yield boundary condition at the wall is presented.
The stick regions in outer corners and the slip region in the center
of the pipe faces are exhibited.
Numerical computations cover the complete range of the dimensionless number describing
the slip yield effect, from a full slip to a full stick flow regime.
The resolution of variational inequalities
describing the flow is based on the...
Proximal Point Methods (PPM) can be traced to the pioneer works of Moreau [16], Martinet [14,
15] and Rockafellar [19, 20] who used as regularization function the square of the Euclidean
norm. In this work, we study PPM in the context of optimization and we derive a class of such
methods which contains Rockafellar's result. We also present a less stringent criterion to the
acceptance of an approximate solution to the subproblems that arise in the inner loops of PPM.
Moreover, we introduce a new...
In the paper, some sufficient optimality conditions for strict minima of order in constrained nonlinear mathematical programming problems involving (locally Lipschitz) -convex functions of order are presented. Furthermore, the concept of strict local minimizer of order is also used to state various duality results in the sense of Mond-Weir and in the sense of Wolfe for such nondifferentiable optimization problems.
Currently displaying 81 –
100 of
108