An explicit characterization of the convex envelope of a bivariate bilinear function over special polytopes

DOI10.1007/BF02283695zbMath0723.90073MaRDI QIDQ2276885

Amine Alameddine, Hanif D. Sherali

Publication date: 1990

Published in: Annals of Operations Research (Search for Journal in Brave)

zbMATH Keywords

branch-and-boundconvex envelopesbilinear function

Mathematics Subject Classification ID

Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Nonlinear programming (90C30)

Related Items

Globally solving nonconvex quadratic programming problems with box constraints via integer programming methods ⋮ Non polyhedral convex envelopes for 1-convex functions ⋮ Tight convex relaxations for the expansion planning problem ⋮ The bipartite Boolean quadric polytope ⋮ Simultaneous Convexification of Bilinear Functions over Polytopes with Application to Network Interdiction ⋮ Convex Envelopes of Some Quadratic Functions over the n-Dimensional Unit Simplex ⋮ Inventory constrained maritime routing and scheduling for multi-commodity liquid bulk I: applications and model ⋮ The Convex Hull of a Quadratic Constraint over a Polytope ⋮ Computing the value of the convex envelope of quadratic forms over polytopes through a semidefinite program ⋮ On convex envelopes for bivariate functions over polytopes ⋮ Existence and sum decomposition of vertex polyhedral convex envelopes ⋮ Two new reformulation convexification based hierarchies for 0-1 MIPs ⋮ A technique to derive the analytical form of convex envelopes for some bivariate functions ⋮ Polyhedral subdivisions and functional forms for the convex envelopes of bilinear, fractional and other bivariate functions over general polytopes ⋮ A new reformulation-linearization technique for bilinear programming problems ⋮ On branching-point selection for trilinear monomials in spatial branch-and-bound: the hull relaxation ⋮ Convex envelopes of bivariate functions through the solution of KKT systems ⋮ Sharp upper and lower bounds for maximum likelihood solutions to random Gaussian bilateral inequality systems ⋮ A simplicial branch-and-bound algorithm for solving quadratically constrained quadratic programs ⋮ Computing the volume of the convex hull of the graph of a trilinear monomial using mixed volumes ⋮ Convex envelopes for ray-concave functions ⋮ The value of shape constraints in discrete moment problems: a review and extension

Cites Work

• A general class of branch-and-bound methods in global optimization with some new approaches for concave minimization
• Constrained global optimization: algorithms and applications
• Jointly Constrained Biconvex Programming
• Supports and convex envelopes
• Concave Minimization Via Collapsing Polytopes
• Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
• Lagrange Multipliers and Nonconvex Programs
• Convex Analysis

This page was built for publication: An explicit characterization of the convex envelope of a bivariate bilinear function over special polytopes