Buradasınız

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

Journal Name:

Publication Year:

Author NameUniversity of AuthorFaculty of Author
Abstract (2. Language): 
In this paper, using by the concept of locally dual mapping, the optimality conditions for solution of a convex optimization problem are deter- mined. Speci¯cally, 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 de¯ned by a set-valued map.
109-118

JEL Codes: