Optimality condition and Wolfe duality for invex interval-valued nonlinear programming problems (Q1790047): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q59003505, #quickstatements; #temporary_batch_1717957830832 |
Created claim: DBLP publication ID (P1635): journals/jam/Zhang13b, #quickstatements; #temporary_batch_1731475607626 |
||
| Property / DBLP publication ID | |||
| Property / DBLP publication ID: journals/jam/Zhang13b / rank | |||
Normal rank | |||
Latest revision as of 07:47, 13 November 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Optimality condition and Wolfe duality for invex interval-valued nonlinear programming problems |
scientific article |
Statements
Optimality condition and Wolfe duality for invex interval-valued nonlinear programming problems (English)
0 references
10 October 2018
0 references
Summary: The concepts of preinvex and invex are extended to the interval-valued functions. Under the assumption of invexity, the Karush-Kuhn-Tucker optimality sufficient and necessary conditions for interval-valued nonlinear programming problems are derived. Based on the concepts of having no duality gap in weak and strong sense, the Wolfe duality theorems for the invex interval-valued nonlinear programming problems are proposed in this paper.
0 references
