Gröbner bases in Asymptotic Analysis of Perturbed Polynomial Programs

Abstract

We consider a perturbed mathematical programming problem where both the objective and the constraint functions are polynomial in all underlying decision variables and in the perturbation parameter \(\varepsilon.\) We study the behaviour of the solutions of such a perturbed problem as \(\varepsilon \rightarrow 0.\) Though the solutions of the programming problems are real, we consider the Karush–Kuhn–Tucker optimality system as a one-dimensional complex algebraic variety in a multi-dimensional complex space. We use the Buchberger’s elimination algorithm of the Grobner bases theory to replace the defining equations of the variety by its Grobner basis, that has the property that one of its elements is bivariate, that is, a polynomial in \(\varepsilon\) and one of the decision variables only. Changing the elimination order in the Buchberger’s algorithm, we obtain such a bivariate polynomial for each of the decision variables. Thus, the solutions of the original system reduces to a number of algebraic functions in \(\varepsilon\) that can be represented as a Puiseux series in \(\varepsilon\) a neighbourhood of \(\varepsilon = 0\). A detailed analysis of the branching order and the order of the pole is also provided. The latter is estimated via characteristics of these bivariate polynomials of Grobner bases.