A reformulation-linearization technique for solving discrete and continuous nonconvex problems

Publication date: 11 March 1999

Published in: Nonconvex Optimization and Its Applications (Search for Journal in Brave)

zbMATH Keywords

branch-and-bound bilinear programming valid inequalities facets nonconvex polynomial programming relaxation for discrete and continuous nonconvex programming problems squared-Euclidean distance location-allocation

Mathematics Subject Classification ID

Mixed integer programming (90C11) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Boolean programming (90C09) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)

Related Items (only showing first 100 items - show all)

On Generalized Surrogate Duality in Mixed-Integer Nonlinear Programming ⋮ A disjunctive cut strengthening technique for convex MINLP ⋮ The effect of strengthened linear formulations on improving the lower bounds for the part families with precedence constraints problem ⋮ On the numerical solution of the quadratic eigenvalue complementarity problem ⋮ Probabilistic logic with independence ⋮ Convexification of Queueing Formulas by Mixed-Integer Second-Order Cone Programming: An Application to a Discrete Location Problem with Congestion ⋮ The probabilistic travelling salesman problem with crowdsourcing ⋮ Computable representations for convex hulls of low-dimensional quadratic forms ⋮ Convex relaxations of non-convex mixed integer quadratically constrained programs: Extended formulations ⋮ The quadratic three-dimensional assignment problem: exact and approximate solution methods ⋮ Comparisons and enhancement strategies for linearizing mixed 0-1 quadratic programs ⋮ On Throughput Maximization Problem for UWB-Based Sensor Networks via Reformulation–Linearization Technique ⋮ Uncertainty Preferences in Robust Mixed-Integer Linear Optimization with Endogenous Uncertainty ⋮ Strategic bidding in price coupled regions ⋮ Large-scale standard pooling problems with constrained pools and fixed demands ⋮ Generalized S-lemma and strong duality in nonconvex quadratic programming ⋮ A multi-commodity flow formulation for the generalized pooling problem ⋮ Strong formulations for the pooling problem ⋮ Robust Investment Management with Uncertainty in Fund Managers’ Asset Allocation ⋮ On the solution of nonconvex cardinality Boolean quadratic programming problems: a computational study ⋮ A branch and bound algorithm for quantified quadratic programming ⋮ A bounded degree SOS hierarchy for polynomial optimization ⋮ Tightening methods based on nontrivial bounds on bilinear terms ⋮ On subspace properties of the quadratically constrained quadratic program ⋮ Spherical cuts for integer programming problems ⋮ Inductive linearization for binary quadratic programs with linear constraints ⋮ Recycling inequalities for robust combinatorial optimization with budget uncertainty ⋮ Variable Bound Tightening and Valid Constraints for Multiperiod Blending ⋮ Enhancing the normalized multiparametric disaggregation technique for mixed-integer quadratic programming ⋮ Characterizing linearizable QAPs by the level-1 reformulation-linearization technique ⋮ Using Two-Dimensional Projections for Stronger Separation and Propagation of Bilinear Terms ⋮ An LP-based characterization of solvable QAP instances with chess-board and graded structures ⋮ A conditional-logic interpretation for Miller-Tucker-Zemlin inequalities and extensions ⋮ Strengthened SDP relaxation for an extended trust region subproblem with an application to optimal power flow ⋮ A reformulation-linearization technique for optimization over simplices ⋮ A penalized nonlinear ADMM algorithm applied to the multi-constrained traffic assignment problem ⋮ Kronecker Product Constraints with an Application to the Two-Trust-Region Subproblem ⋮ Linear programing relaxations for a strategic pricing problem in electricity markets ⋮ Overcoming the Key Challenges in De Novo Protein Design: Enhancing Computational Efficiency and Incorporating True Backbone Flexibility ⋮ Unbounded convex sets for non-convex mixed-integer quadratic programming ⋮ The Convex Hull of a Quadratic Constraint over a Polytope ⋮ A compact variant of the QCR method for quadratically constrained quadratic \(0-1\) programs ⋮ Quadratic 0–1 programming: Tightening linear or quadratic convex reformulation by use of relaxations ⋮ Decomposition algorithms with parametric Gomory cuts for two-stage stochastic integer programs ⋮ Maximization of a PSD quadratic form and factorization ⋮ Extremal problems for convex polygons ⋮ Consistency Analysis for Massively Inconsistent Datasets in Bound-to-Bound Data Collaboration ⋮ Exact solution of emerging quadratic assignment problems ⋮ Spectral Relaxations and Branching Strategies for Global Optimization of Mixed-Integer Quadratic Programs ⋮ Unification of lower-bound analyses of the lift-and-project rank of combinatorial optimization polyhedra ⋮ A new framework to relax composite functions in nonlinear programs ⋮ A branch-and-cut algorithm using polar cuts for solving nonconvex quadratic programming problems ⋮ Relax-tighten-round algorithm for optimal placement and control of valves and chlorine boosters in water networks ⋮ Combining qualitative information and semi‐quantitative data for guaranteed invalidation of biochemical network models ⋮ ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations ⋮ RLT insights into lift-and-project closures ⋮ On the problem of packing spheres in a cube ⋮ Decomposition with branch-and-cut approaches for two-stage stochastic mixed-integer programming ⋮ A scalable global optimization algorithm for stochastic nonlinear programs ⋮ Second order cone constrained convex relaxations for nonconvex quadratically constrained quadratic programming ⋮ On solving discrete two-stage stochastic programs having mixed-integer first- and second-stage variables ⋮ Inductive linearization for binary quadratic programs with linear constraints: a computational study ⋮ Binary programs for asymmetric betweenness problems and relations to the quadratic linear ordering problem ⋮ Novel formulations for the sequence selection problem in de novo protein design with flexible templates ⋮ Source localization using TDOA and FDOA measurements based on semidefinite programming and reformulation linearization ⋮ A Two-Variable Approach to the Two-Trust-Region Subproblem ⋮ Constraint aggregation for rigorous global optimization ⋮ Intersection cuts for nonlinear integer programming: convexification techniques for structured sets ⋮ The trust region subproblem with non-intersecting linear constraints ⋮ The moment-SOS hierarchy: applications and related topics ⋮ MIP relaxations in factorable programming ⋮ Reformulations in Mathematical Programming: Definitions and Systematics ⋮ Mixed Integer Linear Programming Formulation Techniques ⋮ An efficient global algorithm for worst-case linear optimization under uncertainties based on nonlinear semidefinite relaxation ⋮ Quadratic optimization with switching variables: the convex hull for \(n=2\) ⋮ Convexification techniques for linear complementarity constraints ⋮ Convex hull representations for bounded products of variables ⋮ On new methods to construct lower bounds in simplicial branch and bound based on interval arithmetic ⋮ Polyhedral properties of RLT relaxations of nonconvex quadratic programs and their implications on exact relaxations ⋮ Revisiting some classical linearizations of the quadratic binary optimization problem and linkages with constraint aggregations ⋮ Computing in combinatorial optimization ⋮ Convergence rates of RLT and Lasserre-type hierarchies for the generalized moment problem over the simplex and the sphere ⋮ Properties, extensions and application of piecewise linearization for Euclidean norm optimization in \(\mathbb{R}^2\) ⋮ Computational comparison studies of quadratic assignment like formulations for the in silico sequence selection problem in De Novo protein design ⋮ Accelerating branch-and-bound through a modeling language construct for relaxation-specific constraints ⋮ Robust solution of nonconvex global optimization problems ⋮ Linear programming insights into solvable cases of the quadratic assignment problem ⋮ SDP-quality bounds via convex quadratic relaxations for global optimization of mixed-integer quadratic programs ⋮ Probability estimation via policy restrictions, convexification, and approximate sampling ⋮ On sample average approximation for two-stage stochastic programs without relatively complete recourse ⋮ Univariate parameterization for global optimization of mixed-integer polynomial problems ⋮ A binary decision diagram based algorithm for solving a class of binary two-stage stochastic programs ⋮ On generalized surrogate duality in mixed-integer nonlinear programming ⋮ A new branch-and-cut algorithm for non-convex quadratic programming via alternative direction method and semidefinite relaxation ⋮ An accelerating algorithm for globally solving nonconvex quadratic programming ⋮ A strong conic quadratic reformulation for machine-job assignment with controllable processing times ⋮ How to select a small set of diverse solutions to mixed integer programming problems ⋮ A simple recipe for concise mixed 0-1 linearizations ⋮ Symmetry in RLT-type relaxations for the quadratic assignment and standard quadratic optimization problems ⋮ Duality for mixed-integer convex minimization

This page was built for publication: A reformulation-linearization technique for solving discrete and continuous nonconvex problems