Duality for non-differentiable multi-objective semi-infinite programming for higher order invex functions (Q2204609)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7261719
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Duality for non-differentiable multi-objective semi-infinite programming for higher order invex functions |
scientific article; zbMATH DE number 7261719 |
Statements
Duality for non-differentiable multi-objective semi-infinite programming for higher order invex functions (English)
0 references
15 October 2020
0 references
Summary: This paper deals with non-differentiable multi-objective semi-infinite programming problem. It is a problem of simultaneous minimisation of finitely many scalar valued functions subject to an arbitrary (possibly infinite) set of constraints. Non-differentiability enters, due to the square root of a quadratic form which appears in the objective functional. Concept of efficiency of order \(m\) has been extended to the above stated problem. In order to study this new solution concept, the notion of \(\rho\)-invexity of order \(m\) is also proposed which is utilised to establish sufficient optimality conditions for the non-differentiable multi-objective semi-infinite programming problem. Mond-Weir type of dual is proposed for which weak, strong and strict converse duality theorems are established.
0 references
optimality
0 references
duality
0 references
semi-infinite programming
0 references
non-differentiable programming
0 references
\(\rho\)-invexity of order \(m\)
0 references
0.8940243124961853
0 references
0.8785828351974487
0 references
0.878381073474884
0 references
0.8759273886680603
0 references
