Second- and higher-order generalised invexity and duality in mathematical programming (Q1753784)
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 6876013
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Second- and higher-order generalised invexity and duality in mathematical programming |
scientific article; zbMATH DE number 6876013 |
Statements
Second- and higher-order generalised invexity and duality in mathematical programming (English)
0 references
29 May 2018
0 references
Summary: We have introduced the second- and higher-order generalised invex functions and applied it to mathematical programming problems. Also, we have established many duality relations (weak, strong and converse duality) between the non-linear primal problem and their corresponding second- and higher-order dual problems. By taking different examples, we have shown, that second-order duality gives tighter bound than first-order duality. It has also been observed that the higher-order duality gives tighter bound than first- and second-order duality.
0 references
second-order generalised invexity
0 references
second- and higher-order duality results
0 references
0.9030673503875732
0 references
0.8896651268005371
0 references
0.888802170753479
0 references
0.887611985206604
0 references
