Generalized bilinear programming. I: Models, applications and linear programming relaxation

DOI10.1016/0377-2217(92)90082-KzbMath0784.90051OpenAlexW1979690720MaRDI QIDQ1199512

Faiz A. Al-Khayyal

Publication date: 16 January 1993

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(92)90082-k

zbMATH Keywords

bilinear programmingconvex envelopeconvex underestimating functionmultiple modular design problem

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Quadratic programming (90C20) Linear programming (90C05)

Related Items (24)

A global optimization algorithm for linear fractional and bilinear programs ⋮ A relaxation method for nonconvex quadratically constrained quadratic programs ⋮ On subspace properties of the quadratically constrained quadratic program ⋮ Nonlinear 0–1 programming: I. Linearization techniques ⋮ Simultaneous Convexification of Bilinear Functions over Polytopes with Application to Network Interdiction ⋮ An interval estimator for the unmixing of mixtures with set-based source descriptions ⋮ A reducibility method for the weak linear bilevel programming problems and a case study in principal-agent ⋮ Inventory constrained maritime routing and scheduling for multi-commodity liquid bulk I: applications and model ⋮ Oops! I cannot do it again: testing for recursive feasibility in MPC ⋮ Multi-period price promotions in a single-supplier, multi-retailer supply chain under asymmetric demand information ⋮ Reduction of indefinite quadratic programs to bilinear programs ⋮ A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique ⋮ A new reformulation-linearization technique for bilinear programming problems ⋮ A global supply chain model with transfer pricing and transportation cost allocation ⋮ The inverse optimal value problem ⋮ Semidefinite relaxations for quadratically constrained quadratic programming: A review and comparisons ⋮ A simplicial branch-and-bound algorithm for solving quadratically constrained quadratic programs ⋮ Design of planar articulated mechanisms using branch and bound ⋮ Bidimensional packing by bilinear programming ⋮ Generalized bilinear programming: An application in farm management ⋮ Modeling and design of global logistics systems: a review of integrated strategic and tactical models and design algorithms ⋮ Active fault diagnosis under hybrid bounded and Gaussian uncertainties ⋮ Inside-ellipsoid outside-sphere (IEOS) model for general bilinear feasibility problems: feasibility analysis and solution algorithm ⋮ An algorithm for global solution to bi-parametric linear complementarity constrained linear programs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the minimization of quadratic functions with bilinear constraints via augmented Lagrangians
• Jointly constrained bilinear programs and related problems: An overview
• A note on the solution of bilinear programming problems by reduction to concave minimization
• A note on adapting methods for continuous global optimization to the discrete case
• Two-person nonzero-sum games and quadratic programming
• Global optimization of a quadratic function subject to a bounded mixed integer constraint set
• Non-cooperative games
• Equilibrium Points in Finite Games
• The Gradient Projection Method for Nonlinear Programming. Part I. Linear Constraints
• The continuous multiple-modular design problem
• Jointly Constrained Biconvex Programming
• An Algorithm for Finding All Vertices of Convex Polyhedral Sets
• A finitely convergent algorithm for bilinear programming problems using polar cuts and disjunctive face cuts
• Quadratically constrained quadratic programming: Some applications and a method for solution
• A monotonic passy-like algorithm for the modular design problem
• Global Minimization in Nonconvex All-Quadratic Programming
• A cutting plane algorithm for solving bilinear programs
• Bilinear programming: An exact algorithm
• A Simplex-Like Algorithm for the Continuous Modular Design Problem
• A linear max—min problem
• A Dual Method for Quadratic Programs with Quadratic Constraints
• Equilibrium Points of Bimatrix Games
• Modular Design, Generalized Inverses, and Convex Programming
• Bimatrix Equilibrium Points and Mathematical Programming
• An Algorithm for Separable Nonconvex Programming Problems
• Lagrange Multipliers and Nonconvex Programs
• Technical Note—An Integer Approach to Modular Design
• Modular Design: An Application of Structured Geometric Programming
• An Algorithm for Separable Nonconvex Programming Problems II: Nonconvex Constraints
• Quadratic programming with quadratic constraints
• Primal Decomposition of Mathematical Programs by Resource Allocation: II—Computational Algorithm with an Application to the Modular Design Problem
• Modular Design—A Special Case in Nonlinear Programming

This page was built for publication: Generalized bilinear programming. I: Models, applications and linear programming relaxation