The aim of this paper is to investigate several inherited properties of convexity for set-valued maps and develop computational procedure based on such inherited properties. In this paper, we introduced two types of characteristic functions by using Tchebyshev scalarization, and defined four types of scalarization functions to characterize the images of set-valued maps.

In this paper, without assumption of monotonicity, we study the compactness and the connectedness of the weakly efficient solutions set to vector equilibrium problems by using scalarization method in locally convex spaces. Our results improve the corresponding results in [X. H. Gong, Connectedness of the solution sets and scalarization for vector equilibrium problems, J. Optim. Theory Appl. 133...

The multi-objective flexible job shop scheduling in a cellular manufacturing environment is challenging real-world problem. This recently introduced problem variant considers exceptional parts, intercellular moves, transportation times, sequence-dependent family setup and recirculation requiring minimization of makespan total tardiness, simultaneously. A previous study shows that the exact solv...

Considering a vector optimization problem to which properly efficient solutions are defined by using convex cone-monotone scalarization functions, we attach to it, by means of perturbation theory, new vector duals. When the primal problem, the scalarization function and the perturbation function are particularized, different dual vector problems are obtained, some of them already known in the l...

In this paper we study a 1.5-dimensional cutting stock and assortment problem which includes determination of the number of different widths of roll stocks to be maintained as inventory and determination of how these roll stocks should be cut by choosing the optimal cutting pattern combinations. We propose a new multi-objective mixed integer linear programming (MILP) model in the form of simult...

The objective of this paper is to deal with the fuzzy conic program- ming problems. The aim here is to derive weak and strong duality theorems for a general fuzzy conic programming. Toward this end, The convexity-like concept of fuzzy mappings is introduced and then a speci c ordering cone is established based on the parameterized representation of fuzzy numbers. Un- der this setting, duality t...

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 ...

In this study, an environmental economic active power dispatch problem is transformed into an optimization problem with a single-objective function by applying the weighted sum method (WSM) and the conic scalarization method (CSM). A pseudo spot price of electricity algorithm (PSPA) is used to solve the transformed problem. This is demonstrated on an example problem, which is a lossy electrical...