On various duality theorems in nonlinear programming (Q1078078): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/bf00938952 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2029978297 / rank | |||
Normal rank | |||
Latest revision as of 08:45, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On various duality theorems in nonlinear programming |
scientific article |
Statements
On various duality theorems in nonlinear programming (English)
0 references
1987
0 references
Recently, Gulati and Craven and Mond and Egudo established strict converse duality theorems for some of Mond-Weir duals for nonlinear programming problems. Here, we establish various duality theorems under weaker convexity conditions that are different from those of Gulati and Craven, Mond and Weir, and Mond and Egudo.
0 references
Mond-Weir duals
0 references
duality theorems
0 references
weaker convexity conditions
0 references
