Optimization By Sequential Techniques

In this thesis we examine the following type of problem: Given a sequence of functions f(,n)(x) which converge to f(x), what can we say about the convergence of the minima of f(,n)(x) to the minima of f(x)?With suitable hypothesis on the convergence, like uniform convergence or monotonic convergence or convergence in the sense of distributions, we prove that the minima of f(,n)(x) converge.These results are, then, applied to give alternate ways of solving the fixed charge problem and the integer programming problem.