Results 11 to 20 of about 478 (71)
Pareto front approximation through a multi-objective augmented Lagrangian method
EURO Journal on Computational Optimization, 2021 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
Solving polyhedral d.c. optimization problems via concave minimization [PDF]
, 2020 The problem of minimizing the difference of two convex functions is called polyhedral d.c. optimization problem if at least one of the two component functions is polyhedral.
Dahl, Simeon vom, Löhne, Andreas
core +2 more sources
Combining the cross-entropy algorithm and ∈-constraint method for multiobjective optimization
Moroccan Journal of Pure and Applied Analysis, 2021 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
AIMS Mathematics, 2023 Yemen has suffered from a civil war since 2015, which caused the largest famine in the world at this time. People came in need of urgent humanitarian relief in all sectors.
Ibrahim M. Hezam
doaj +1 more source
Intelligent Systems with Applications, 2022 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
An Inequality Approach to Approximate Solutions of Set Optimization Problems in Real Linear Spaces [PDF]
, 2020 This paper explores new notions of approximate minimality in set optimization using a set approach. We propose characterizations of several approximate minimal elements of families of sets in real linear spaces by means of general functionals, which can ...
Köbis, Elisabeth +2 more
core +1 more source
Second-Order Karush-Kuhn-Tucker Optimality Conditions for Vector Problems with Continuously Differentiable Data and Second-Order Constraint Qualifications [PDF]
, 2014 Some necessary and sufficient optimality conditions for inequality constrained problems with continuously differentiable data were obtained in the papers [I. Ginchev and V.I. Ivanov, Second-order optimality conditions for problems with C$\sp{1}$ data, J.
Ivanov, Vsevolod I.
core +1 more source
A fuzzy multi-objective linear programming with interval-typed triangular fuzzy numbers
Open Mathematics, 2019 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
International Journal of Stochastic Analysis, Volume 16, Issue 3, Page 267-273, 2003., 2003 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
Journal of Applied Mathematics, Volume 2003, Issue 7, Page 365-376, 2003., 2003 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