A new reformulation-linearization technique for bilinear programming problems
From MaRDI portal
Publication:1201905
DOI10.1007/BF00122429zbMath0791.90056MaRDI QIDQ1201905
Amine Alameddine, Hanif D. Sherali
Publication date: 17 January 1993
Published in: Journal of Global Optimization (Search for Journal in Brave)
Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items
Natural gas production network infrastructure development under uncertainty, COMPARISON BETWEEN FIVE MINLP SOLVERS AND NEW RESULTS RELATED TO TRIGONOMETRIC FUNCTIONS, A localization and reformulation discrete programming approach for the rectilinear distance location-allocation problem, A hierarchy of relaxations and convex hull characterizations for mixed- integer zero-one programming problems, Normalized multiparametric disaggregation: an efficient relaxation for mixed-integer bilinear problems, Branch-and-bound decomposition approach for solving quasiconvex-concave programs, The minimum diameter octagon with unit-length sides: Vincze's wife's octagon is suboptimal, Optimal design of mixed AC-DC distribution systems for commercial buildings: a nonconvex generalized Benders decomposition approach, A global optimization algorithm for linear fractional and bilinear programs, Unnamed Item, Decomposition methods for solving a class of nonconvex programming problems dealing with bilinear and quadratic functions, Disjoint Bilinear Optimization: A Two-Stage Robust Optimization Perspective, Lifting inequalities: a framework for generating strong cuts for nonlinear programs, Petroleum refinery optimization, Comparison of mixed-integer relaxations with linear and logarithmic partitioning schemes for quadratically constrained problems, Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO, Computable representations for convex hulls of low-dimensional quadratic forms, Solving generalized polynomial problem by using new affine relaxed technique, An exact reformulation algorithm for large nonconvex nLPs involving bilinear terms, A reformulation-convexification approach for solving nonconvex quadratic programming problems, DC Programming Approaches for BMI and QMI Feasibility Problems, \(\alpha BB\): A global optimization method for general constrained nonconvex problems, Canonical duality for box constrained nonconvex and nonsmooth optimization problems, GLOMIQO: global mixed-integer quadratic optimizer, Piecewise parametric structure in the pooling problem: from sparse strongly-polynomial solutions to NP-hardness, A multi-objective approach for PH-graphs with applications to stochastic shortest paths, Linearized Robust Counterparts of Two-Stage Robust Optimization Problems with Applications in Operations Management, An FPTAS for optimizing a class of low-rank functions over a polytope, A branch-and-reduce approach to global optimization, Biconvex Models and Algorithms for Risk Management Problems, Global optimization of mixed-integer quadratically-constrained quadratic programs (MIQCQP) through piecewise-linear and edge-concave relaxations, Dynamically generated cutting planes for mixed-integer quadratically constrained quadratic programs and their incorporation into GloMIQO 2, Global optimization of bilinear programs with a multiparametric disaggregation technique, An augmented Lagrangian based semismooth Newton method for a class of bilinear programming problems, Decomposition strategy for the stochastic pooling problem, On interval-subgradient and no-good cuts, A framework for globally optimizing mixed-integer signomial programs, Simultaneous Convexification of Bilinear Functions over Polytopes with Application to Network Interdiction, A mixed-integer linear programming reduction of disjoint bilinear programs via symbolic variable elimination, The Bipartite Boolean Quadric Polytope with Multiple-Choice Constraints, Efficient separation of RLT cuts for implicit and explicit bilinear products, A game‐theoretic approach for the location of terror response facilities with both disruption risk and hidden information, A potential practical algorithm for minimizing the sum of affine fractional functions, Facets of a mixed-integer bilinear covering set with bounds on variables, A reducibility method for the weak linear bilevel programming problems and a case study in principal-agent, Quantifying outcome functions of linear programs: an approach based on interval-valued right-hand sides, Exploiting vector space properties to strengthen the relaxation of bilinear programs arising in the global optimization of process networks, An effective global algorithm for worst-case linear optimization under polyhedral uncertainty, A branch-and-bound algorithm for instrumental variable quantile regression, Long term scheduling technique for wastewater minimisation in multipurpose batch processes, The Convex Hull of a Quadratic Constraint over a Polytope, Unnamed Item, Multi-period price promotions in a single-supplier, multi-retailer supply chain under asymmetric demand information, A lagrangean based branch-and-cut algorithm for global optimization of nonconvex mixed-integer nonlinear programs with decomposable structures, Solving Quadratic Programming by Cutting Planes, Extremal problems for convex polygons, Accelerating convergence of cutting plane algorithms for disjoint bilinear programming, Exact \(L_{2}\)-norm plane separation, Reduction of indefinite quadratic programs to bilinear programs, Global optimization of non-convex generalized disjunctive programs: a review on reformulations and relaxation techniques, Optimality-based bound contraction with multiparametric disaggregation for the global optimization of mixed-integer bilinear problems, ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations, Global optimization of general nonconvex problems with intermediate polynomial substructures, New multi-commodity flow formulations for the pooling problem, Reduction constraints for the global optimization of NLPs, A global supply chain model with transfer pricing and transportation cost allocation, Convex quadratic relaxations of nonconvex quadratically constrained quadratic programs, Global optimization of general non-convex problems with intermediate bilinear substructures, Improve-and-branch algorithm for the global optimization of nonconvex NLP problems, A new two-level linear relaxed bound method for geometric programming problems, Tractable stochastic analysis in high dimensions via robust optimization, Convex envelopes for edge-concave functions, A simplicial branch-and-bound algorithm for solving quadratically constrained quadratic programs, A branch-and-cut algorithm for mixed-integer bilinear programming, Optimal influenza vaccine distribution with equity, Mathematical programming formulations for the alternating current optimal power flow problem, Mathematical programming formulations for the alternating current optimal power flow problem, Reformulations in Mathematical Programming: Definitions and Systematics, Solving mixed-integer nonlinear optimization problems using simultaneous convexification: a case study for gas networks, Convex hull representations for bounded products of variables, Reformulation in mathematical programming: An application to quantum chemistry, Process planning in a fuzzy environment, A new Lagrangean approach to the pooling problem, Exact and heuristic solutions of the global supply chain problem with transfer pricing, Complexity Results and Effective Algorithms for Worst-Case Linear Optimization Under Uncertainties, The Migratory Beekeeping Routing Problem: Model and an Exact Algorithm, Enhanced intersection cutting-plane approach for linear complementarity problems, Optimal Design for Multi-Item Auctions: A Robust Optimization Approach, Discretization and global optimization for mixed integer bilinear programming, On the finite convergence of successive SDP relaxation methods, A new class of improved convex underestimators for twice continuously differentiable constrained NLPs, AC optimal power flow: a conic programming relaxation and an iterative MILP scheme for global optimization, Linearity embedded in nonconvex programs, Collaborative vehicle-drone distribution network optimization for perishable products in the epidemic situation, Probability chains: a general linearization technique for modeling reliability in facility location and related problems, A hierarchy of relaxations leading to the convex hull representation for general discrete optimization problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Combined branch-and-bound and cutting plane methods for solving a class of nonlinear programming problems
- Jointly constrained bilinear programs and related problems: An overview
- A general class of branch-and-bound methods in global optimization with some new approaches for concave minimization
- Linear, quadratic, and bilinear programming approaches to the linear complementarity problem
- A note on the solution of bilinear programming problems by reduction to concave minimization
- Efficient algorithms for solving rank two and rank three bilinear programming problems
- A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique
- Generalized bilinear programming. I: Models, applications and linear programming relaxation
- An explicit characterization of the convex envelope of a bivariate bilinear function over special polytopes
- Global optimization of a quadratic function subject to a bounded mixed integer constraint set
- A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
- Jointly Constrained Biconvex Programming
- An Algorithm for Global Minimization of Linearly Constrained Concave Quadratic Functions
- A finitely convergent algorithm for bilinear programming problems using polar cuts and disjunctive face cuts
- An algorithm for nonconvex programming problems
- The bilinear programming problem
- A cutting plane algorithm for solving bilinear programs
- Maximization of A convex quadratic function under linear constraints
- A cutting plane algorithm for the bilinear programming problem
- Nonlinear Programming: Counterexamples to Two Global Optimization Algorithms
- A method for solving maximum-problems with a nonconcave quadratic objective function
- Lagrange Multipliers and Nonconvex Programs
