Results 121 to 130 of about 565 (171)

Nondifferentiable multiobjective programming under generalized dI-invexity

In this paper, we are concerned with a nondifferentiable multiobjective programming problem with inequality constraints. We introduce new concepts of dI-invexity and generalized dI-invexity in which each component of the objective and constraint ...
Slimani, Hachem, Radjef, Mohammed Said
core  

Duality in mathematical programming. [PDF]

, 2016
In this thesis entitled, “Duality in Mathematical Programming”, the emphasis is given on formulation and conceptualization of the concepts of second-order duality, second-order mixed duality, second-order symmetric duality in a variety of ...
Mashoob Masoodi (Scholar), I. Husain (Co-Guide), Aquil Ahmed (Guide)   +2 more
core  

A new mathematical approach for handling DVH criteria in IMRT planning. [PDF]

J Glob Optim, 2015
Scherrer A, Yaneva F, Grebe T, Küfer KH.   +3 more
europepmc   +1 more source

Fractional analysis of non-linear fuzzy partial differential equations by using a direct procedure. [PDF]

Sci Rep
Arshad M, Khan S, Khan H, Ali H, Ali I.
europepmc   +1 more source

Zulfia Invexity: Structural Origin and Emergence of Invexity

Invexity generalizes convexity by replacing linear displacement with an admissible direction map-ping, ensuring global optimality of stationary points beyond convex settings. However, the admissibledirection is externally specified, and its structural origin remains unexplained.In this paper, we introduce Zulfia Invexity as a source-generative ...
openaire   +1 more source

Application of Newton's polynomial interpolation scheme for variable order fractional derivative with power-law kernel. [PDF]

Sci Rep
Naveen S, Parthiban V.
europepmc   +1 more source

On Pair Invexity in Optimization — A Coupled Mapping Generalization of Invexity

This paper introduces a Pair Invexity framework based on coupled mappings for constrainedoptimization problems. The framework is built upon the coupled mapping;P (x, u) = Ψ(η1(x, u), η2(x, u)),and Pair Invexity is defined throughf (x) − f (u) ≥ ∇f (u)T P (x, u), ∀x, u ∈ X.The proposed framework is developed for ...
openaire   +1 more source

Author invex

Biochimica et Biophysica Acta (BBA) - Biomembranes, 1996
openaire   +1 more source

Non-differentiable invex

, 1999
It is well known that various properties of constrained optimization, such as converse Karush-Kuhn-Tucker and duality, remain valid when convex hypotheses are much relaxed, e.g. to invex. But convex does not need derivatives, whereas invex does. However, there is a property intermediate between convexifiable (by transformation of the domain) and invex,
openaire   +1 more source

A Note on Scalar “Generalized” Invexity [PDF]

Journal of Information and Optimization Sciences, 2019
This paper aims to study how much ``generalized'' invex properties differ from invexity and to establish whether or not the use of more and more parameters and functionals in the definitions is really effective and helpful.
Riccardo Cambini, Laura Carosi
exaly   +2 more sources