Multi-parametric disaggregation technique for global optimization of polynomial programming problems
From MaRDI portal
Publication:1941031
DOI10.1007/s10898-011-9809-8zbMath1268.90092OpenAlexW1987429668WikidataQ57563445 ScholiaQ57563445MaRDI QIDQ1941031
João P. Teles, Pedro M. Castro, Henrique A. Matos
Publication date: 11 March 2013
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10400.9/2444
Related Items
Solving a class of generalized fractional programming problems using the feasibility of linear programs ⋮ Normalized multiparametric disaggregation: an efficient relaxation for mixed-integer bilinear problems ⋮ Comparison of mixed-integer relaxations with linear and logarithmic partitioning schemes for quadratically constrained problems ⋮ Global optimization of bilinear programs with a multiparametric disaggregation technique ⋮ Enhancing the normalized multiparametric disaggregation technique for mixed-integer quadratic programming ⋮ Solving data envelopment analysis models with sum-of-fractional objectives: a global optimal approach based on the multiparametric disaggregation technique ⋮ Optimality-based bound contraction with multiparametric disaggregation for the global optimization of mixed-integer bilinear problems ⋮ New multi-commodity flow formulations for the pooling problem ⋮ Optimal influenza vaccine distribution with equity ⋮ Joint location and pricing within a user-optimized environment ⋮ Discretization and global optimization for mixed integer bilinear programming ⋮ Univariate parameterization for global optimization of mixed-integer polynomial problems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Treating free variables in generalized geometric global optimization programs
- On generalized geometric programming problems with non-positive variables
- Global solution of optimization problems with signomial parts
- Convex underestimation for posynomial functions of positive variables
- Global optimization of signomial mixed-integer nonlinear programming problems with free variables
- Some transformation techniques with applications in global optimization
- A collection of test problems for constrained global optimization algorithms
- An approximate approach of global optimization for polynomial programming problems
- Handbook of test problems in local and global optimization
- Global optimization of signomial geometric programming using linear relaxation.
- Linearization method of global optimization for generalized geometric programming
- Outer approximation algorithms for separable nonconvex mixed-integer nonlinear programs
- Trilinear monomials with mixed sign domains: Facets of the convex and concave envelopes
- Finding all solutions of nonlinearly constrained systems of equations
- State of the art in global optimization: computational methods and applications. Papers of the conference, Princeton, NJ, USA, April 28--30, 1995
- Accelerating method of global optimization for signomial geometric programming
- Geometric programming with signomials
- A deterministic global optimization algorithm for generalized geometric programming
- Convex relaxation for solving posynomial programs
- Global Optimization with Polynomials and the Problem of Moments
- A MATHEMATICAL AID IN OPTIMIZING ENGINEERING DESIGNS
- A FURTHER MATHEMATICAL AID IN OPTIMIZING ENGINEERING DESIGNS
- Convex underestimation strategies for signomial functions
- Complementary Geometric Programming
- A set of geometric programming test problems and their solutions
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Generalized Polynomial Optimization
- Duality Theory for Geometric Programming
- Linearizing Geometric Programs
This page was built for publication: Multi-parametric disaggregation technique for global optimization of polynomial programming problems
