Symmetric duality in non-differentiable programming using \(G\)-invexity (Q2204253)
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 7261372
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Symmetric duality in non-differentiable programming using \(G\)-invexity |
scientific article; zbMATH DE number 7261372 |
Statements
Symmetric duality in non-differentiable programming using \(G\)-invexity (English)
0 references
15 October 2020
0 references
Summary: Mond-Weir and Wolfe type non-differentiable primal and dual symmetric problems in mathematical programming are formulated. In this paper, we use a generalisation of convexity, namely \(G\)-invexity, to prove weak, strong and converse duality relations for the two non-differentiable symmetric programming problems. Some previous known results for symmetric programming problems turn out to be special cases of the results established in the paper.
0 references
nonlinear programming
0 references
symmetric duality
0 references
support function
0 references
duality results
0 references
\(G\)-invexity
0 references
0.8815820813179016
0 references
0.8771654963493347
0 references
0.8586703538894653
0 references
