Jointly constrained bilinear programs and related problems: An overview
From MaRDI portal
Publication:918873
DOI10.1016/0898-1221(90)90148-DzbMath0706.90074OpenAlexW1978108972MaRDI QIDQ918873
Publication date: 1990
Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0898-1221(90)90148-d
Convex programming (90C25) Nonlinear programming (90C30) Quadratic programming (90C20) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Related Items (43)
A branch-and-bound multi-parametric programming approach for non-convex multilevel optimization with polyhedral constraints ⋮ On a stochastic bilevel programming problem ⋮ A relaxation method for nonconvex quadratically constrained quadratic programs ⋮ Global optimization of a quadratic function subject to a bounded mixed integer constraint set ⋮ \(\alpha BB\): A global optimization method for general constrained nonconvex problems ⋮ Global optimization for the biaffine matrix inequality problem ⋮ On the global solution of multi-parametric mixed integer linear programming problems ⋮ Deterministic solution approach for some classes of nonlinear multilevel programs with multiple followers ⋮ A piecewise linearization framework for retail shelf space management models ⋮ The Bipartite Boolean Quadric Polytope with Multiple-Choice Constraints ⋮ Ellipsoidal buffered area under the curve maximization model with variable selection in credit risk estimation ⋮ A reducibility method for the weak linear bilevel programming problems and a case study in principal-agent ⋮ A bilinear approach to the pooling problem† ⋮ An effective global algorithm for worst-case linear optimization under polyhedral uncertainty ⋮ Matrix criteria for the pseudo-P-convexity of a quadratic form ⋮ Rigorous filtering using linear relaxations ⋮ Unnamed Item ⋮ Algorithms for separable nonlinear least squares with application to modelling time-resolved spectra ⋮ Accelerating convergence of cutting plane algorithms for disjoint bilinear programming ⋮ Biconvex sets and optimization with biconvex functions: a survey and extensions ⋮ Degeneracy removal in cutting plane methods for disjoint bilinear programming ⋮ Generalized bilinear programming. I: Models, applications and linear programming relaxation ⋮ An application of Lipschitzian global optimization to product design ⋮ New multi-commodity flow formulations for the pooling problem ⋮ A new reformulation-linearization technique for bilinear programming problems ⋮ Duality bound method for the general quadratic programming problem with quadratic constraints ⋮ A global supply chain model with transfer pricing and transportation cost allocation ⋮ Pricing and revenue maximization over a multicommodity transportation network: the nonlinear demand case ⋮ \(H_\infty\) optimization-based decentralized control of linear interconnected systems with nonlinear interconnections ⋮ A rigorous global filtering algorithm for quadratic constraints ⋮ Solution of a large-scale two-stage decision and scheduling problem using decomposition ⋮ Design of planar articulated mechanisms using branch and bound ⋮ A jointly constrained bilinear programming method for solving generalized Cournot–Pareto models ⋮ A new branch-and-cut algorithm for linear sum-of-ratios problem based on SLO method and LO relaxation ⋮ Generalized bilinear programming: An application in farm management ⋮ Identification of mechanical properties of arteries with certification of global optimality ⋮ Modeling and design of global logistics systems: a review of integrated strategic and tactical models and design algorithms ⋮ New properties and computational improvement of the GOP algorithm for problems with quadratic objective functions and constraints ⋮ A new technique for generating quadratic programming test problems ⋮ Linear, quadratic, and bilinear programming approaches to the linear complementarity problem ⋮ Note on solving linear complementarity problems as jointly constrained bilinear programs ⋮ Global optimization algorithms for linearly constrained indefinite quadratic problems ⋮ Primal-relaxed dual global optimization approach
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the minimization of quadratic functions with bilinear constraints via augmented Lagrangians
- Linear, quadratic, and bilinear programming approaches to the linear complementarity problem
- Global minimization of indefinite quadratic problems
- Enumerative techniques for solving some nonconvex global optimization problems
- Plastic-elastic torsion, optimal stopping and free boundaries
- Two-person nonzero-sum games and quadratic programming
- Complementary pivot theory of mathematical programming
- Equilibrium Points in Finite Games
- The Gradient Projection Method for Nonlinear Programming. Part I. Linear Constraints
- Jointly Constrained Biconvex Programming
- Global minimization of large-scale constrained concave quadratic problems by separable programming
- An implicit enumeration procedure for the general linear complementarity problem
- An Algorithm for Global Minimization of Linearly Constrained Concave Quadratic Functions
- Global Optimization Approach to the Linear Complementarity Problem
- 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
- A variable dimension algorithm for the linear complementarity problem
- A bilinear programming formulation of the 3-dimensional assignment problem
- Minimization of a Non-Separable Objective Function Subject to Disjoint Constraints
- The bilinear programming problem
- A cutting plane algorithm for solving bilinear programs
- Maximization of A convex quadratic function under linear constraints
- Bilinear programming: An exact algorithm
- A cutting plane algorithm for the bilinear programming problem
- The Indefinite Quadratic Programming Problem
- A linear max—min problem
- Nonlinear Programming: Counterexamples to Two Global Optimization Algorithms
- Equilibrium Points of Bimatrix Games
- Bimatrix Equilibrium Points and Mathematical Programming
- A method for solving maximum-problems with a nonconcave quadratic objective function
- Lagrange Multipliers and Nonconvex Programs
- Solving Certain Nonconvex Quadratic Minimization Problems by Ranking the Extreme Points
- A Method for Solving the Indefinite Quadratic Programming Problem
- Technical Note—Complementary Programming
- Solving the Fixed Charge Problem by Ranking the Extreme Points
This page was built for publication: Jointly constrained bilinear programs and related problems: An overview
