Journal of Applied Mathematics and Decision Sciences
Volume 2006 (2006), Article ID 29023, 16 pages
doi:10.1155/JAMDS/2006/29023

Reverse convex problems: an approach based on optimality conditions

Ider Tseveendorj

PRiSM Laboratory, Computer Science Department, University of Versailles Saint Quentin en Yvelines, 45 avenue des Etats-Unis, Versailles Cedex 78035, France

Received 9 February 2006; Accepted 10 February 2006

Copyright © 2006 Ider Tseveendorj. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Abstract

We present some results concerning reverse convex problems. Global optimality conditions for the problems with a nonsmooth reverse convex constraint are established and convergence of an algorithm in the case of linear program with an additional quadratic reverse convex constraint is studied.