| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 9663888 | European Journal of Operational Research | 2005 | 4 Pages |
Abstract
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 η, these problems are convex transformable. Hence certain associated convex problems should be solved. Some applications are shown.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Marek Galewski,