Approximate solutions and Lagrangian duality for semi-infinite mathematical programming problems

Project: Research

Description

Epsilon-optimality conditions are given for a nonconvex programming problem which has an infinite number of convex constraints. In a first part the concept of regular epsilon-solution is introduced and a generalization of the Karush-Kuhn-Tucker conditions is proposed. In a second part quasi saddle-points associated with an epsilon-Lagrangian functional is defined and their relations with generalized KKT conditions are investigated
StatusActive
Effective start/end date1/09/06 → …