Some algebraic methods for solving multiobjective polynomial integer programs

DOI10.1016/J.JSC.2010.10.003zbMATH Open1216.90075DBLPjournals/jsc/BlancoP11arXiv0902.1304OpenAlexW2031879192WikidataQ58217201 ScholiaQ58217201MaRDI QIDQ633078FDOQ633078

Authors: Víctor Blanco, Justo Puerto 

Publication date: 31 March 2011

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/0902.1304

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

zbMATH Keywords

integer programmingmultiple objective nonlinear optimizationGröbner bases

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Mixed integer programming (90C11) Applications of commutative algebra (e.g., to statistics, control theory, optimization, etc.) (13P25)

Cites Work

• Ideals, varieties, and algorithms. An introduction to computational algebraic geometry and commutative algebra
• Title not available (Why is that?)
• Using Algebraic Geometry
• Nonlinear multiobjective optimization
• An evolutionary heuristic for the index tracking problem.
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Nonlinear integer programming
• Global optimality conditions for quadratic optimization problems with binary constraints
• An algorithm for finding the basis elements of the residue class ring of a zero dimensional polynomial ideal
• A semidefinite programming approach to the generalized problem of moments
• Quadratic Binary Programming with Application to Capital-Budgeting Problems
• Approximative solution methods for multiobjective combinatorial optimization. With discussion and a rejoinder by the authors.
• The Nonlinear Resource Allocation Problem
• An improved algorithm for solving biobjective integer programs
• Partial Gröbner bases for multiobjective integer linear optimization
• Computing global minima to polynomial optimization problems using Gröbner bases
• Computational aspects of alternative portfolio selection models in the presence of discrete asset choice constraints
• A new algebraic geometry algorithm for integer programming
• A Survey of Methods for Pure Nonlinear Integer Programming
• The multicriteria big cube small cube method
• Title not available (Why is that?)

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 exact algebraic \(\epsilon \)-constraint method for bi-objective linear integer programming based on test sets
• An algebraic approach to integer portfolio problems
• 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)