Solving Mixed Integer Bilinear Problems Using MILP Formulations
From MaRDI portal
Publication:2848171
DOI10.1137/110836183zbMath1300.90021OpenAlexW2031279142MaRDI QIDQ2848171
Myun Seok Cheon, Akshay Gupte, Shabbir Ahmed, Santanu S. Dey
Publication date: 25 September 2013
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://www.pure.ed.ac.uk/ws/files/137476899/110836183.pdf
Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26)
Related Items (38)
Generalized average shadow prices and bottlenecks ⋮ Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO ⋮ Scheduling under linear constraints ⋮ Binary extended formulations of polyhedral mixed-integer sets ⋮ Robust assortment optimization under sequential product unavailability ⋮ Piecewise parametric structure in the pooling problem: from sparse strongly-polynomial solutions to NP-hardness ⋮ Decomposing Loosely Coupled Mixed-Integer Programs for Optimal Microgrid Design ⋮ The Rank-One Quadratic Assignment Problem ⋮ Fractional 0-1 programming: applications and algorithms ⋮ A bi-objective mathematical model for integrated planning of sugarcane harvesting and transport operations ⋮ A Bayesian framework for molecular strain identification from mixed diagnostic samples ⋮ Preprocessing algorithm and tightening constraints for multiperiod blend scheduling: cost minimization ⋮ A mean-risk mixed integer nonlinear program for transportation network protection ⋮ Stochastic dual dynamic integer programming ⋮ The bipartite Boolean quadric polytope ⋮ Knapsack with variable weights satisfying linear constraints ⋮ Simultaneous Convexification of Bilinear Functions over Polytopes with Application to Network Interdiction ⋮ Holistic fleet optimization incorporating system design considerations ⋮ The Bipartite Boolean Quadric Polytope with Multiple-Choice Constraints ⋮ Multi-objective optimization for integrated sugarcane cultivation and harvesting planning ⋮ Tightening discretization-based MILP models for the pooling problem using upper bounds on bilinear terms ⋮ Convex hulls of superincreasing knapsacks and lexicographic orderings ⋮ A note on linearized reformulations for a class of bilevel linear integer problems ⋮ LP Formulations for Polynomial Optimization Problems ⋮ Optimal insurance contract specification in the upstream sector of the oil and gas industry ⋮ A robust decision-support method based on optimization and simulation for wildfire resilience in highly renewable power systems ⋮ On Dantzig figures from graded lexicographic orders ⋮ Relaxations and discretizations for the pooling problem ⋮ Modeling max-min fair bandwidth allocation in BitTorrent communities ⋮ Public R\&D project portfolio selection problem with cancellations ⋮ An integer linear programming approach for a class of bilinear integer programs ⋮ A branch-and-cut algorithm for mixed-integer bilinear programming ⋮ A binarisation heuristic for non-convex quadratic programming with box constraints ⋮ Convexification of bilinear forms through non-symmetric lifting ⋮ Extended formulations for convex hulls of some bilinear functions ⋮ Representations of quadratic combinatorial optimization problems: a case study using quadratic set covering and quadratic knapsack problems ⋮ Discretization and global optimization for mixed integer bilinear programming ⋮ Special issue: Global solution of integer, stochastic and nonconvex optimization problems
Uses Software
This page was built for publication: Solving Mixed Integer Bilinear Problems Using MILP Formulations
