Generalized bilinear programming. I: Models, applications and linear programming relaxation
From MaRDI portal
After a short presentation of the evolution of bilinear programming, the author defines a class of generalized bilinear programs and shows that the multiple modular design problem is a special case of the general model. Generalized bilinear programs are defined as (P) `Minimize \(\Phi_ 0(x,y)\), subject to \(\Phi_ i(x,y)\leq b_ i\) \((i=1,\dots,p)\), \((x,y)\in S\), where \(\Phi_ i(x,y)= c^ T_ i x+ x^ T A_ i y+ d^ T_ i y\) \((i=0,1,\dots,p)\) and \(S=\{(x,y): Cx+ Dy\leq b,\;x\geq 0,\;y\geq 0\}\).' The author solves problem (P) by replacing each \(\Phi_ i\) with its convex envelope or a convex underestimating function.
Recommendations
- A linear programming approach to solving bilinear programmes
- A symmetrical linear maxmin approach to disjoint bilinear programming
- scientific article; zbMATH DE number 4104722
- A linear programming approach to solving a jointly constrained bilinear programming problem with special structure
- Jointly constrained bilinear programs and related problems: An overview
Cites work
- A cutting plane algorithm for solving bilinear programs
- A Dual Method for Quadratic Programs with Quadratic Constraints
- A finitely convergent algorithm for bilinear programming problems using polar cuts and disjunctive face cuts
- A linear max—min problem
- A monotonic passy-like algorithm for the modular design problem
- A note on adapting methods for continuous global optimization to the discrete case
- A note on the solution of bilinear programming problems by reduction to concave minimization
- A Simplex-Like Algorithm for the Continuous Modular Design Problem
- An Algorithm for Finding All Vertices of Convex Polyhedral Sets
- An Algorithm for Separable Nonconvex Programming Problems
- An Algorithm for Separable Nonconvex Programming Problems II: Nonconvex Constraints
- Bilinear programming: An exact algorithm
- Bimatrix Equilibrium Points and Mathematical Programming
- Equilibrium Points in Finite Games
- Equilibrium Points of Bimatrix Games
- Global Minimization in Nonconvex All-Quadratic Programming
- Global optimization of a quadratic function subject to a bounded mixed integer constraint set
- scientific article; zbMATH DE number 3871035 (Why is no real title available?)
- scientific article; zbMATH DE number 47153 (Why is no real title available?)
- scientific article; zbMATH DE number 3338972 (Why is no real title available?)
- Jointly Constrained Biconvex Programming
- Jointly constrained bilinear programs and related problems: An overview
- Lagrange Multipliers and Nonconvex Programs
- Modular Design, Generalized Inverses, and Convex Programming
- Modular Design: An Application of Structured Geometric Programming
- Modular Design—A Special Case in Nonlinear Programming
- Non-cooperative games
- On the minimization of quadratic functions with bilinear constraints via augmented Lagrangians
- Primal Decomposition of Mathematical Programs by Resource Allocation: II—Computational Algorithm with an Application to the Modular Design Problem
- Quadratic programming with quadratic constraints
- Quadratically constrained quadratic programming: Some applications and a method for solution
- Technical Note—An Integer Approach to Modular Design
- The continuous multiple-modular design problem
- The Gradient Projection Method for Nonlinear Programming. Part I. Linear Constraints
- Two-person nonzero-sum games and quadratic programming
Cited in
(25)- Bidimensional packing by bilinear programming
- 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
- Generalized bilinear programming: An application in farm management
- The inverse optimal value problem
- A simplicial branch-and-bound algorithm for solving quadratically constrained quadratic programs
- Design of planar articulated mechanisms using branch and bound
- Modeling and design of global logistics systems: a review of integrated strategic and tactical models and design algorithms
- A global optimization algorithm for linear fractional and bilinear programs
- A relaxation method for nonconvex quadratically constrained quadratic programs
- 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
- A reducibility method for the weak linear bilevel programming problems and a case study in principal-agent
- An algorithm for global solution to bi-parametric linear complementarity constrained linear programs
- On subspace properties of the quadratically constrained quadratic program
- Inventory constrained maritime routing and scheduling for multi-commodity liquid bulk I: applications and model
- Multi-period price promotions in a single-supplier, multi-retailer supply chain under asymmetric demand information
- Nonlinear 0–1 programming: I. Linearization techniques
- scientific article; zbMATH DE number 4104722 (Why is no real title available?)
- Oops! I cannot do it again: testing for recursive feasibility in MPC
- Simultaneous convexification of bilinear functions over polytopes with application to network interdiction
- A global supply chain model with transfer pricing and transportation cost allocation
- Semidefinite relaxations for quadratically constrained quadratic programming: A review and comparisons
- An interval estimator for the unmixing of mixtures with set-based source descriptions
This page was built for publication: Generalized bilinear programming. I: Models, applications and linear programming relaxation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1199512)
