.png){kind=icon}
.png){kind=icon}
Return
A note on invex problems with nonnegative variable
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ejor.2003.11.016.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We provide sufficient optimality conditions involving invexity for mathematical programming problems with nonnegative variable. We also show that upon certain assumptions on the scaling function eta, these problems are convex transformable. Hence certain associated convex problems should be solved. Some applications are shown. (C) 2003 Elsevier B.V. All rights reserved.
Keywords:
nonlinear programming
nonnegative variable
invexity
KKT conditions
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6
Papers:
2.2W
Citations:
6.4W
Organization
No organization information available