On Optimality Conditions for a Convex Optimization Problem with Polyhedral Discrete Inclusions


Değer Ö.

University of Istanbul Faculty of Science the Journal of Mathematics, Physics and Astronomy, New Series, vol.3, pp.109-118, 2011 (Peer-Reviewed Journal)

Abstract

In this paper, using by the concept of locally dual mapping, the optimality conditions for solution of a convex optimization problem are determined. Specifically, the sets and the inclusions in the considered problem are polyhedral. Furthermore, the problem is given by a discrete inclusions system with discrete time. The polyhedral discrete inclusions in the problem are defined by a set-valued map.