Global optimization of bilinear programs with a multiparametric disaggregation technique
From MaRDI portal
Recommendations
- Normalized multiparametric disaggregation: an efficient relaxation for mixed-integer bilinear problems
- Optimality-based bound contraction with multiparametric disaggregation for the global optimization of mixed-integer bilinear problems
- Discretization and global optimization for mixed integer bilinear programming
- Univariate parameterization for global optimization of mixed-integer polynomial problems
- Global optimization of multi-parametric MILP problems
Cites work
- scientific article; zbMATH DE number 757677 (Why is no real title available?)
- scientific article; zbMATH DE number 914364 (Why is no real title available?)
- A Linearization Procedure for Quadratic and Cubic Mixed-Integer Problems
- A global optimization algorithm for linear fractional and bilinear programs
- A new reformulation-linearization technique for bilinear programming problems
- Advances for the pooling problem: modeling, global optimization, and computational studies (Survey)
- An exact reformulation algorithm for large nonconvex nLPs involving bilinear terms
- An iterative approach to quadratic optimization
- Approximating quadratic programming with bound and quadratic constraints
- BARON: A general purpose global optimization software package
- CONOPT—A Large-Scale GRG Code
- Comparison of generalized geometric programming algorithms
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
- Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization Problems
- Dual quadratic estimates in polynomial and Boolean programming
- Exploiting special structures in constructing a hierarchy of relaxations for \(0-1\) mixed integer problems
- Exploiting vector space properties to strengthen the relaxation of bilinear programs arising in the global optimization of process networks
- GLOMIQO: global mixed-integer quadratic optimizer
- Generalized disjunctive programming: a framework for formulation and alternative algorithms for MINLP optimization
- Global optimization of signomial geometric programming using linear relaxation.
- Jointly Constrained Biconvex Programming
- Mixed-integer models for nonseparable piecewise-linear optimization: unifying framework and extensions
- Modeling disjunctive constraints with a logarithmic number of binary variables and constraints
- Multi-parametric disaggregation technique for global optimization of polynomial programming problems
- Review of nonlinear mixed-integer and disjunctive programming techniques
- Semidefinite relaxation and nonconvex quadratic optimization
- Test examples for nonlinear programming codes
Cited in
(35)- New multi-commodity flow formulations for the pooling problem
- The Bipartite Boolean Quadric Polytope with Multiple-Choice Constraints
- Solving certain complementarity problems in power markets via convex programming
- Dynamically generated cutting planes for mixed-integer quadratically constrained quadratic programs and their incorporation into GloMIQO 2
- Tightening discretization-based MILP models for the pooling problem using upper bounds on bilinear terms
- Convexification of bilinear forms through non-symmetric lifting
- The \(p\)-Lagrangian relaxation for separable nonconvex MIQCQP problems
- Solving data envelopment analysis models with sum-of-fractional objectives: a global optimal approach based on the multiparametric disaggregation technique
- Normalized multiparametric disaggregation: an efficient relaxation for mixed-integer bilinear problems
- Preprocessing algorithm and tightening constraints for multiperiod blend scheduling: cost minimization
- Discretization and global optimization for mixed integer bilinear programming
- Enhancing the normalized multiparametric disaggregation technique for mixed-integer quadratic programming
- Approximating maxmin strategies in imperfect recall games using A-loss recall property
- Joint location and pricing within a user-optimized environment
- An adaptive discretization algorithm for the design of water usage and treatment networks
- Optimization under decision-dependent uncertainty
- Optimal influenza vaccine distribution with equity
- Time consistent expected mean-variance in multistage stochastic quadratic optimization: a model and a matheuristic
- Multiobjective optimization for aircraft conflict resolution. A metaheuristic approach
- Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO
- Spatial branch-and-bound algorithm for MIQCPs featuring multiparametric disaggregation
- Global optimality bounds for the placement of control valves in water supply networks
- Comparison of mixed-integer relaxations with linear and logarithmic partitioning schemes for quadratically constrained problems
- Output feedback design for discrete-time constrained systems subject to persistent disturbances via bilinear programming
- Univariate parameterization for global optimization of mixed-integer polynomial problems
- QPLIB: a library of quadratic programming instances
- Some matheuristic algorithms for multistage stochastic optimization models with endogenous uncertainty and risk management
- On preparedness resource allocation planning for natural disaster relief under endogenous uncertainty with time-consistent risk-averse management
- ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations
- Optimality-based bound contraction with multiparametric disaggregation for the global optimization of mixed-integer bilinear problems
- Global optimization of MIQCPs with dynamic piecewise relaxations
- Product disaggregation in global optimization and relaxations of rational programs
- Piecewise parametric structure in the pooling problem: from sparse strongly-polynomial solutions to NP-hardness
- Variable Bound Tightening and Valid Constraints for Multiperiod Blending
- Tightening methods based on nontrivial bounds on bilinear terms
This page was built for publication: Global optimization of bilinear programs with a multiparametric disaggregation technique
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q386453)
