• No results found

[PDF] Top 20 Efficiency and Generalized Convex Duality for Nondifferentiable Multiobjective Programs

Has 10000 "Efficiency and Generalized Convex Duality for Nondifferentiable Multiobjective Programs" found on our website. Below are the top 20 most common "Efficiency and Generalized Convex Duality for Nondifferentiable Multiobjective Programs".

Efficiency and Generalized Convex Duality for Nondifferentiable Multiobjective Programs

Efficiency and Generalized Convex Duality for Nondifferentiable Multiobjective Programs

... some duality results between primal problem and Wolfe type dual ...the duality results of Wolfe 3 for scalar convex programming problems and some of the more duality results for scalar ... See full document

10

Proper efficiency and duality for a new class of nonconvex multitime multiobjective variational problems

Proper efficiency and duality for a new class of nonconvex multitime multiobjective variational problems

... of generalized convex functions was introduced in nonlinear scalar optimization problems by Bector et ...nonlinear multiobjective programming prob- lems with univex functions to obtain new sufficient ... See full document

20

Optimality and duality results for a nondifferentiable multiobjective fractional programming problem

Optimality and duality results for a nondifferentiable multiobjective fractional programming problem

... and duality results have been obtained for multiobjective fractional programming ...[], multiobjective fractional problem and its duality theorems have been considered under higher-order (F, ... See full document

18

Symmetric duality for a higher order nondifferentiable multiobjective programming problem

Symmetric duality for a higher order nondifferentiable multiobjective programming problem

... dual programs over arbitrary cones has been studied and then well-suited duality relations have been established considering K-F convexity ...weak duality relation has also been ... See full document

12

Symmetric duality for nondifferentiable multiobjective fractional variational problems involving cones

Symmetric duality for nondifferentiable multiobjective fractional variational problems involving cones

... [] generalized these results to static and continuous nonlinear fractional ...the multiobjective case of static nonlinear fractional program, symmetric duality was established under convexity ... See full document

15

Optimality Conditions in Nondifferentiable G Invex Multiobjective Programming

Optimality Conditions in Nondifferentiable G Invex Multiobjective Programming

... invex programs, and Jeyakumar and Mond 6 introduced the class of the so-called V-invex functions to proved some optimality for a class of differentiable vector optimization problems than under invexity ...some ... See full document

13

Sufficiency and duality in nondifferentiable multiobjective programming involving higher order strong invexity

Sufficiency and duality in nondifferentiable multiobjective programming involving higher order strong invexity

... and duality results for multiobjective op- timization problems involving locally Lipschitz functions and type I ...nondifferentiable multiobjective programming problem and discussed duality ... See full document

12

Multiobjective Nonlinear Symmetric Duality Involving Generalized Pseudoconvexity

Multiobjective Nonlinear Symmetric Duality Involving Generalized Pseudoconvexity

... strong duality theorems were established under second order F-convexity assump- ...dual multiobjective programs over arbitrary cones. The duality theorems and the self-dual theorem were ... See full document

7

Optimality Conditions and Duality in Nonsmooth Multiobjective Programs

Optimality Conditions and Duality in Nonsmooth Multiobjective Programs

... nonsmooth multiobjective programming problems involving locally Lipschitz functions and support ...using generalized convexity and certain regularity ...nonsmooth multiobjective problems and ... See full document

12

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

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

... fractional programs with certain convexity ...for multiobjective fractional programming problem and established weak and strong dua- lity ...of nondifferentiable multiobjective frac- tional ... See full document

12

Second order duality for nondifferentiable minimax fractional programming problems with generalized convexity

Second order duality for nondifferentiable minimax fractional programming problems with generalized convexity

... It is well known that the minimax fractional programming has wide applications. These types of problems arise in the design of electronic circuits; moreover, minimax fractional programming problems appear in formulation ... See full document

9

Generalized (ℱ,b,φ,ρ,θ) univex n set functions and global semiparametric sufficient efficiency
conditions in multiobjective fractional subset programming

Generalized (ℱ,b,φ,ρ,θ) univex n set functions and global semiparametric sufficient efficiency conditions in multiobjective fractional subset programming

... converse duality results for a parametric dual problem for (P) under appropriate (ρ, b)-vexity ...some duality relations for a nonfractional multiobjective subset programming ...are convex, ... See full document

25

Duality for nondifferentiable multiobjective higher order symmetric programs over cones involving generalized (F,α,ρ,d) convexity

Duality for nondifferentiable multiobjective higher order symmetric programs over cones involving generalized (F,α,ρ,d) convexity

... in multiobjective programming and discussed their corrective ...second-order multiobjective sym- metric dual programs with cone constraints and established duality results under ... See full document

16

Efficiency and Duality in Nondifferentiable Multiobjective Programming Involving Directional Derivative

Efficiency and Duality in Nondifferentiable Multiobjective Programming Involving Directional Derivative

... a convex function to any vector function   x x ,  ...further generalized to pseudo Type I and quasi Type I functions by Rueda and Hanson ...[7] generalized subgradients under Type I ... See full document

9

Risk measures on P(R) and value at risk with probability/loss function

Risk measures on P(R) and value at risk with probability/loss function

... Complete duality: The complete duality in the class of quasi-convex monotone maps on vector spaces was first obtained by Cerreia-Vioglio et ...complete duality proved in Drapeau and Kupper ... See full document

23

On Second Order Duality in Nondifferentiable Continuous Programming

On Second Order Duality in Nondifferentiable Continuous Programming

... of nondifferentiable continuous programming problems is ...various duality theorems are established for this pair of dual continuous programming ...various duality results are briefly ...second-order ... See full document

7

Non differentiable multiobjective mixed symmetric duality under generalized convexity

Non differentiable multiobjective mixed symmetric duality under generalized convexity

... non-differentiable multiobjective nonlinear programming problems where each of the objective functions contains a pair of support ...converse duality theorems are established for the model under some ... See full document

10

Generalized  Invariant Monotonicity and Generalized  Invexity of Nondifferentiable Functions

Generalized Invariant Monotonicity and Generalized Invexity of Nondifferentiable Functions

... of generalized ρ, θ-η invariant monotone operators and generalized ρ, θ-η invex functions and discuss the relationships between generalized ρ, θ-η invariant monotonicity and generalized ρ, θ-η ... See full document

16

Second Order Duality for Continuous Programming Containing Support Functions

Second Order Duality for Continuous Programming Containing Support Functions

... of nondifferentiable dual variational problems with natural boundary values rather than fixed end ...for duality theo- rems for this pair of dual problems is omitted as they follow immediately on the basis ... See full document

8

Duality without constraint qualification in nonsmooth optimization

Duality without constraint qualification in nonsmooth optimization

... for duality was relaxed and a constraint qual- ification was not ...for multiobjective programs. They defined dual problems for a convex multiobjective programming and a ... See full document

11

Show all 10000 documents...