Local programming. (Q1395207)

The paper deals with local programming problems with the additional constraint \(\| x-a\| \leq\varepsilon\). It turns out that if \(a\) is a regular point of the original problem and \({\varepsilon}>0\) is sufficiently small, these problems behave as convex ones, even though neither the objective function nor the constraints are assumed to be convex. The duality theory for local programming problems is developed.