Results 1 to 10 of about 66 (66)
Pareto front approximation through a multi-objective augmented Lagrangian method
In this manuscript, we consider smooth multi-objective optimization problems with convex constraints. We propose an extension of a multi-objective augmented Lagrangian Method from recent literature.
Guido Cocchi +2 more
doaj +1 more source
Combining the cross-entropy algorithm and ∈-constraint method for multiobjective optimization
This paper aims to propose a new hybrid approach for solving multiobjective optimization problems. This approach is based on a combination of global and local search procedures.
Ezzine Abdelmajid +2 more
doaj +1 more source
We propose new mathematical models of inventory management in a reverse logistics system. The proposed models extend the model introduced by Nahmias and Rivera with the assumption that the demand for newly produced and repaired (remanufacturing) items ...
M. Forkan, M.M. Rizvi, M.A.M. Chowdhury
doaj +1 more source
A fuzzy multi-objective linear programming with interval-typed triangular fuzzy numbers
A multi-objective linear programming problem (ITF-MOLP) is presented in this paper, in which coefficients of both the objective functions and constraints are interval-typed triangular fuzzy numbers. An algorithm of the ITF-MOLP is provided by introducing
Li Chunquan
doaj +1 more source
A note of stability of weakly efficient solution set for optimization with set‐valued maps
In this paper, we study the stability of weakly efficient solution sets for optimization problems with set‐valued maps. We introduce the concept of essential weakly efficient solutions and essential components of weakly efficient solution sets. We first show that most optimization problems with set‐valued maps (in the sense of Baire category) are ...
Luo Qun
wiley +1 more source
On generalized derivatives for C1,1 vector optimization problems
We introduce generalized definitions of Peano and Riemann directional derivatives in order to obtain second‐order optimality conditions for vector optimization problems involving C1,1 data. We show that these conditions are stronger than those in literature obtained by means of second‐order Clarke subdifferential.
Davide La Torre
wiley +1 more source
A new method for obtaining sensitivity information for parametric vector optimization problems (VOP) v is presented, where the parameters in the objective functions and anywhere in the constraints. This method depends on using differential equations technique for solving multiobjective nonlinear programing problems which is very effective in finding ...
Fatma M. Ali
wiley +1 more source
Symmetric duality for a class of multiobjective programming
We formulate a pair of symmetric dual nondifferentiable multiobjective programming and establish appropriate duality theorems. We also show that differentiable and nondifferentiable analogues of several pairs of symmetric dual problems can be obtained as special cases of our general symmetric programs.
Xinmin Yang, Shouyang Wang, Duan Li
wiley +1 more source
Characterizations of the Solution Sets of Generalized Convex Fuzzy Optimization Problem
This paper provides some new characterizations of the solution sets for non-differentiable generalized convex fuzzy optimization problem. Firstly, we introduce some new generalized convex fuzzy functions and discuss the relationships among them. Secondly,
Chen Wang, Zhou Zhiang
doaj +1 more source
On stability of a Pareto-optimal solution under perturbations of the parameters for a multicriteria combinatorial partition problem [PDF]
We consider a multicriteria variant for the well-known partition problem. A formula of the stability radius for an efficient solution was obtained. Mathematics Subject Classification 2000: 90C27, 90C29, 90C31.
V.A. Emelichev, E.E. Gurevsky
doaj

