Second- and higher-order generalised invexity and duality in mathematical programming (Q1753784): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (4 intermediate revisions by 3 users not shown) | |||
| Property / author | |||
| Property / author: Chandal Nahak / rank | |||
| Property / author | |||
| Property / author: Chandal Nahak / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1504/ijmor.2013.052459 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2136200239 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 10:23, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Second- and higher-order generalised invexity and duality in mathematical programming |
scientific article |
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
