Some algebraic methods for solving multiobjective polynomial integer programs |
| |
Authors: | Víctor Blanco |
| |
Affiliation: | a Departamento de Álgebra, Facultad de Ciencias, Universidad de Granada, 18071 Granada, Spainb Departamento de Estadística e Investigación Operativa, Facultad de Matemáticas, Universidad de Sevilla, 41012 Sevilla, Spain |
| |
Abstract: | Multiobjective discrete programming is a well-known family of optimization problems with a large spectrum of applications. The linear case has been tackled by many authors during the past few years. However, the polynomial case has not been studied in detail due to its theoretical and computational difficulties. This paper presents an algebraic approach for solving these problems. We propose a methodology based on transforming the polynomial optimization problem to the problem of solving one or more systems of polynomial equations and we use certain Gröbner bases to solve these systems. Different transformations give different methodologies that are theoretically stated and compared by some computational tests via the algorithms that they induce. |
| |
Keywords: | Multiple objective nonlinear optimization Integer programming Grö bner bases |
本文献已被 ScienceDirect 等数据库收录! |
|