This work is devoted to examining inverse vector variational inequalities with constraints by means of a prominent nonlinear scalarizing functional. We show that inverse vector variational inequalities are equivalent to multiobjective optimization problems with a variable domination structure. Moreover, we introduce a nonlinear function based on a well-known nonlinear scalarization function. We...

Scalarization of the multiobjective programming problems with fuzzy coefficients using the embedding theorem and the concept of convex cone (ordering cone) is proposed in this paper. Since the set of all fuzzy numbers can be embedded into a normed space, this motivation naturally inspires us to invoke the scalarization techniques in vector optimization problems to evaluate the multiobjective pr...

Only for you today! Discover your favourite adaptive scalarization methods in multiobjective optimization book right here by downloading and getting the soft file of the book. This is not your time to traditionally go to the book stores to buy a book. Here, varieties of book collections are available to download. One of them is this adaptive scalarization methods in multiobjective optimization ...

A numerical method is proposed for constructing an approximation of the Pareto front of nonconvex multi-objective optimal control problems. First, a suitable scalarization technique is employed for the multi-objective optimal control problem. Then by using a grid of scalarization parameter values, i.e., a grid of weights, a sequence of single-objective optimal control problems are solved to obt...

In this paper we consider a vector optimization problem; we present some scalarization techniques for finding all the vector optimal points of this problem and we discuss the relationships between these methods. Moreover, in the linear case, the study of dual variables is carried on by means of sensitivity analysis and also by a parametric approach. We also give an interpretation of the dual va...

In this paper, we consider the multiobjective linear programs where coefficients in the objective function belong to uncertainty sets. We introduce the concept of robust efficient solutions to uncertain multiobjective linear programming problems. By using two scalarization methods, the weighted sum method and the ϵ-constraint method, we obtain that the robust efficient solutions for uncertain m...

It is known that vector variational inequality models arises from vector optimization and vector traac equilibria. In this paper, existence results of a solution for a generalized pre-vector variational inequality and a generalized pre-quasi-vector variational inequality are established. The main condition used is that the underlying vector-valued function is assumed to be cone-quasi-convex. Th...

Marcelo Salgado, Daniel Sudarsky Instituto de Ciencias Nucleares Universidad Nacional Autónoma de México Apdo. Postal 70-543 México 04510 D.F, México and Ulises Nucamendi Departamento de F́ısica Centro de Investigación y de Estudios Avanzados del I.P.N. A. P. 14-741, México, D. F. 07000, México. Abstract We study in the physical frame the phenomenon of spontaneous scalarization that occurs in sc...

This is an overview of a few possibilities that are open by model theory in applied mathematics. The most attention is paid to the present state and frontiers of the Cauchy method of majorants, approximation of operator equations with finite-dimensional analogs, and the Lagrange multiplier principle in multiobjective decision making. DOI: 10.1134/S1990478909010116 The union of functional analys...

The aim of this paper is to implement some new techniques, based on conjugate duality in convex optimization, for proving the existence of global error bounds for convex inequality systems. We deal first of all with systems described via one convex inequality and extend the achieved results, by making use of a celebrated scalarization function, to convex inequality systems expressed by means of...