Results 21 to 30 of about 1,898 (263)
On Constrained Set-Valued Semi-Infinite Programming Problems with ρ-Cone Arcwise Connectedness
Axioms, 2021 In this paper, we establish sufficient Karush–Kuhn–Tucker (for short, KKT) conditions of a set-valued semi-infinite programming problem (SP) via the notion of contingent epiderivative of set-valued maps. We also derive duality results of Mond–Weir (MWD),
Koushik Das, Savin Treanţă
doaj +1 more source
Optimality Conditions for Nondifferentiable Multiobjective Semi-Infinite Programming Problems
Abstract and Applied Analysis, 2016 We have considered a multiobjective semi-infinite programming problem with a feasible set defined by inequality constraints. First we studied a Fritz-John type necessary condition. Then, we introduced two constraint qualifications and derive the weak and
D. Barilla, G. Caristi, A. Puglisi
doaj +1 more source
International Journal for Simulation and Multidisciplinary Design Optimization, 2020 In this paper, we study a nonsmooth semi-infinite multi-objective E-convex programming problem involving support functions. We derive sufficient optimality conditions for the primal problem.
Emam Tarek
doaj +1 more source
Lagrange duality and saddle point optimality conditions for semi-infinite mathematical programming problems with equilibrium constraints [PDF]
Yugoslav Journal of Operations Research, 2019 In this paper, we consider a special class of optimization problems which contains infinitely many inequality constraints and finitely many complementarity constraints known as the semi-infinite mathematical programming problem with equilibrium ...
Singh Kunwar V.K. +2 more
doaj +1 more source
Generalized semi-infinite programming: A tutorial
Journal of Computational and Applied Mathematics, 2008 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Stein, O. +3 more
openaire +2 more sources
A projected lagrangian algorithm for semi-infinite programming [PDF]
Mathematical Programming, 1985 The authors consider nonlinear semi-infinite optimization problems of type min\(\{\) f(a)\(|\) g(x,a)\(\leq 0\) for all \(x\in X\}\) with a box \(X\subset {\mathbb{R}}^ N\), and \(C^ 2\)-functions f, g. Under appropriate regularity assumptions one may consider the local maxima (w.r.t. variable x) of g(x,a) as functions \(x^ i(a)\) of a, and the problem
Ian D. Coope, G. Alistair Watson
openaire +2 more sources
FEBS Letters, EarlyView.In this study, we found that human cervical‐derived adipocytes maintain intracellular iron level by regulating the expression of iron transport‐related proteins during adrenergic stimulation. Melanotransferrin is predicted to interact with transferrin receptor 1 based on in silico analysis.
Rahaf Alrifai +9 more
wiley +1 more source
Diversity and complexity in neural organoids
FEBS Letters, EarlyView.Neural organoid research aims to expand genetic diversity on one side and increase tissue complexity on the other. Chimeroids integrate multiple donor genomes within single organoids. Self‐organising multi‐identity organoids, exogenous cell seeding, or enforced assembly of region‐specific organoids contribute to tissue complexity.
Ilaria Chiaradia, Madeline A. Lancaster
wiley +1 more source
On Nonsmooth Semi-Infinite Minimax Programming Problem with (Φ,ρ)-Invexity
Abstract and Applied Analysis, 2014 We are interested in a nonsmooth minimax programming Problem (SIP). Firstly, we establish the necessary optimality conditions theorems for Problem (SIP) when using the well-known Caratheodory's theorem.
X. L. Liu +3 more
doaj +1 more source
Modelling stem cell differentiation related processes—A practical overview for biologists
FEBS Letters, EarlyView.Stem cell differentiation is complex and difficult to control experimentally. This review introduces suitable computational modelling approaches that can support stem cell research, from mechanistic ODE and abstract models to multiscale and deep learning methods.
Ricco Zeegelaar +4 more
wiley +1 more source