Results 21 to 30 of about 516 (82)

Duality in nondifferentiable minimax fractional programming with B-(p, r)- invexity

open access: yes, 2011
In this article, we are concerned with a nondifferentiable minimax fractional programming problem. We derive the sufficient condition for an optimal solution to the problem and then establish weak, strong, and strict converse duality theorems for the ...
I. Ahmad   +3 more
semanticscholar   +1 more source

Total Lagrange duality for DC infinite optimization problems

open access: yesFixed Point Theory and Applications, 2013
We present some total Lagrange duality results for inequality systems involving infinitely many DC functions. By using properties of the subdifferentials of involved functions, we introduce some new notions of constraint qualifications.
D. Fang, Zhe Chen
semanticscholar   +2 more sources

On ε-optimality conditions for multiobjective fractional optimization problems

open access: yes, 2011
A multiobjective fractional optimization problem (MFP), which consists of more than two fractional objective functions with convex numerator functions and convex denominator functions, finitely many convex constraint functions, and a geometric constraint
M. Kim, G. Kim, G. Lee
semanticscholar   +1 more source

A fuzzy semi-infinite optimization problem

open access: yesJournal of Inequalities and Applications, 2014
In this paper, we present a fuzzy semi-infinite optimization problem. Moreover, we will deduce the Fritz-John and Kuhn-Tucker necessary conditions of this problem.
A. A. Megahed
semanticscholar   +2 more sources

Second-order composed contingent epiderivatives and set-valued vector equilibrium problems

open access: yesJournal of Inequalities and Applications, 2014
In this paper, we introduce the concept of a second-order composed contingent epiderivative for set-valued maps and discuss some of its properties.
Qilin Wang   +4 more
semanticscholar   +2 more sources

Presolving linear bilevel optimization problems

open access: yesEURO Journal on Computational Optimization, 2021
Linear bilevel optimization problems are known to be strongly NP-hard and the computational techniques to solve these problems are often motivated by techniques from single-level mixed-integer optimization.
Thomas Kleinert   +3 more
doaj  

Higher-order symmetric duality for a class of multiobjective fractional programming problems

open access: yes, 2012
In this paper, a pair of nondifferentiable multiobjective fractional programming problems is formulated. For a differentiable function, we introduce the definition of higher-order (F, α, ρ, d)-convexity, which extends some kinds of generalized convexity,
Gao Ying
semanticscholar   +1 more source

Exact upper and lower bounds on the difference between the arithmetic and geometric means

open access: yes, 2015
Let $X$ denote a nonnegative random variable with $\mathsf{E ...
Pinelis, Iosif
core   +1 more source

Topical functions: Hermite-Hadamard type inequalities and Kantorovich duality

open access: yes, 2018
For a certain class of elementary functions consisting of min-type functions, we apply techniques from abstract convex analysis to study Hermite-Hadamard type inequalities for increasing and plus-homogeneous (topical) functions.
M. Daryaei, A. R. Doagooei
semanticscholar   +1 more source

On the Aubin property of a class of parameterized variational systems [PDF]

open access: yes, 2017
The paper deals with a new sharp criterion ensuring the Aubin property of solution maps to a class of parameterized variational systems. This class includes parameter-dependent variational inequalities with non-polyhedral constraint sets and also ...
Gfrerer, Helmut, Outrata, Jiří V
core   +3 more sources

Home - About - Disclaimer - Privacy