Some algebraic methods for solving multiobjective polynomial integer programs
From MaRDI portal
(Redirected from Publication:633078)
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 last years. However, the polynomial case has not been deeply studied 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 in the problem of solving one or more systems of polynomial equations and we use certain Gr"obner bases to solve these systems. Different transformations give different methodologies that are analyzed and compared from a theoretical point of view and by some computational experiments via the algorithms that they induce.
Recommendations
- Partial Gröbner bases for multiobjective integer linear optimization
- Applying Gröbner basis method to multiparametric polynomial nonlinear programming
- Multiple-objective programming with polynomial objectives and constraints
- Finding multiplies solutions for non-linear integer programming
- Identifying efficient solutions in multiple objective integer monotone programs
Cites work
- scientific article; zbMATH DE number 417962 (Why is no real title available?)
- scientific article; zbMATH DE number 177867 (Why is no real title available?)
- scientific article; zbMATH DE number 1104299 (Why is no real title available?)
- scientific article; zbMATH DE number 2063780 (Why is no real title available?)
- scientific article; zbMATH DE number 1827070 (Why is no real title available?)
- A Survey of Methods for Pure Nonlinear Integer Programming
- A new algebraic geometry algorithm for integer programming
- A semidefinite programming approach to the generalized problem of moments
- An algorithm for finding the basis elements of the residue class ring of a zero dimensional polynomial ideal
- An evolutionary heuristic for the index tracking problem.
- An improved algorithm for solving biobjective integer programs
- Approximative solution methods for multiobjective combinatorial optimization. With discussion and a rejoinder by the authors.
- Computational aspects of alternative portfolio selection models in the presence of discrete asset choice constraints
- Computing global minima to polynomial optimization problems using Gröbner bases
- Global optimality conditions for quadratic optimization problems with binary constraints
- Ideals, varieties, and algorithms. An introduction to computational algebraic geometry and commutative algebra
- Nonlinear integer programming
- Nonlinear multiobjective optimization
- Partial Gröbner bases for multiobjective integer linear optimization
- Quadratic Binary Programming with Application to Capital-Budgeting Problems
- The Nonlinear Resource Allocation Problem
- The multicriteria big cube small cube method
- Using Algebraic Geometry
Cited in
(10)- A new complexity result on multiobjective linear integer programming using short rational generating functions
- An algebraic algorithm for solving parametric integer programs
- Partial Gröbner bases for multiobjective integer linear optimization
- A semidefinite programming approach for solving multiobjective linear programming
- A decision space algorithm for multiobjective convex quadratic integer optimization
- Finding multiplies solutions for non-linear integer programming
- An algebraic approach to integer portfolio problems
- An exact algebraic \(\epsilon \)-constraint method for bi-objective linear integer programming based on test sets
- Finding multiple solutions in nonlinear integer programming with algebraic test-sets
- Applying Gröbner basis method to multiparametric polynomial nonlinear programming
This page was built for publication: Some algebraic methods for solving multiobjective polynomial integer programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q633078)
