A cutting plane algorithm for solving bilinear programs

Cites work

A linear max—min problem
A method for solving maximum-problems with a nonconcave quadratic objective function
Equilibrium Points in Finite Games
Equilibrium Points of Bimatrix Games
scientific article; zbMATH DE number 3520156 (Why is no real title available?)
scientific article; zbMATH DE number 3215121 (Why is no real title available?)
scientific article; zbMATH DE number 3338972 (Why is no real title available?)
Maximization of A convex quadratic function under linear constraints
Nonlinear Power of Adjacent Extreme Point Methods in Linear Programming
Nonlinear Programming: Counterexamples to Two Global Optimization Algorithms
On Connections Between Zero-One Integer Programming and Concave Programming Under Linear Constraints
Solving Certain Nonconvex Quadratic Minimization Problems by Ranking the Extreme Points
Two-person nonzero-sum games and quadratic programming

Cited in

(80)

An exact penalty on bilevel programs with linear vector optimization lower level
Linear, quadratic, and bilinear programming approaches to the linear complementarity problem
Reformulation of mathematical programming problems as linear complementarity problems and investigation of their solution methods
A note on the solution of bilinear programming problems by reduction to concave minimization
A computational analysis of LCP methods for bilinear and concave quadratic programming
Hierarchical optimization: An introduction
Efficient algorithms for solving rank two and rank three bilinear programming problems
The complementary convex structure in global optimization
Generalized bilinear programming. I: Models, applications and linear programming relaxation
A new reformulation-linearization technique for bilinear programming problems
A linear programming approach to solving bilinear programmes
Linear multiplicative programming
Generalized bilinear programming: An application in farm management
The maximization of a function over the efficient set via a penalty function approach
Calculating a minimal sphere containing a polytope defined by a system of linear inequalities
Penalty function approach to linear trilevel programming
New global algorithms for quadratic programming with a few negative eigenvalues based on alternative direction method and convex relaxation
A copositive approach for two-stage adjustable robust optimization with uncertain right-hand sides
Cyclic seesaw process for optimization and identification
The inverse optimal value problem
A study of local solutions in linear bilevel programming
Generation of disjointly constrained bilinear programming test problems
Decomposition methods for solving a class of nonconvex programming problems dealing with bilinear and quadratic functions
On the convergence of the block nonlinear Gauss-Seidel method under convex constraints
Estimating heterogeneous agent preferences by inverse optimization in a randomized nonatomic game
The value of shape constraints in discrete moment problems: a review and extension
Semidefinite programming hierarchies for constrained bilinear optimization
LP-based approximations for disjoint bilinear and two-stage adjustable robust optimization
An augmented Lagrangian based semismooth Newton method for a class of bilinear programming problems
A reducibility method for the weak linear bilevel programming problems and a case study in principal-agent
Separable concave minimization via partial outer approximation and branch and bound
Location of a conservative hyperplane for cutting plane methods in disjoint bilinear programming
Undercover: a primal MINLP heuristic exploring a largest sub-MIP
A bilinear reduction based algorithm for solving capacitated multi-item dynamic pricing problems
Accelerating convergence of cutting plane algorithms for disjoint bilinear programming
The continuity of two functions associated with a maximin problem with connected variables
On the indefinite quadratic bilevel programming problem.
Dynamic slope scaling procedure and Lagrangian relaxation with subproblem approximation
An exact penalty method for weak linear bilevel programming problem
Two-stage network constrained robust unit commitment problem
Enhanced intersection cutting-plane approach for linear complementarity problems
Continuous quadratic programming formulations of optimization problems on graphs
Capacitated, balanced, sequential location-allocation problems on chains and trees
A decomposition approach for global optimum search in QP, NLP and MINLP problems
Two-stage optimization problems with multivariate stochastic order constraints
Sum of squares certificates for containment of \(\mathcal{H}\)-polytopes in \(\mathcal{V}\)-polytopes
On a stochastic bilevel programming problem
A hierarchical approach for sparse source blind signal separation problem
On characterizing linear complementarity problems as linear programs
New product introduction against a predator: a bilevel mixed-integer programming approach
An FPTAS for optimizing a class of low-rank functions over a polytope
Optimization of linear-convex programs
A finitely convergent algorithm for bilinear programming problems using polar cuts and disjunctive face cuts
Maximization of A convex quadratic function under linear constraints
Robust location transportation problems under uncertain demands
Disjoint Bilinear Optimization: A Two-Stage Robust Optimization Perspective
Degeneracy removal in cutting plane methods for disjoint bilinear programming
Subdeterminants and concave integer quadratic programming
On engineering game theory with its application in power systems
Optimization over the efficient set
A global supply chain model with transfer pricing and transportation cost allocation
Pareto adaptive robust optimality via a Fourier-Motzkin elimination lens
Effectiveness of Nash equilibrium search algorithms in four-person games in general and multi-matrix settings
An effective global algorithm for worst-case linear optimization under polyhedral uncertainty
A dual method for polar cuts in disjoint bilinear programming
Data-driven optimization for seismic-resilient power network planning
LP-based approximations for disjoint bilinear and two-stage adjustable robust optimization
A disjunctive cutting plane algorithm for bilinear programming
A multilevel bilinear programming algorithm for the vertex separator problem
Mixed-integer bilinear programming problems
Globally solving concave quadratic programs via doubly nonnegative relaxation
Improved randomized approaches to the location of a conservative hyperplane
On the solution of NP-hard linear complementarity problems
Global optimization from concave minimization to concave mixed variational inequality
On the global minimization of concave functions
Global optimization algorithms for linearly constrained indefinite quadratic problems
A simplex approach for finding local solutions of a linear bilevel program by equilibrium points
A new branch-and-cut algorithm for non-convex quadratic programming via alternative direction method and semidefinite relaxation
Bilinear modeling solution approach for fixed charge network flow problems
Jointly constrained bilinear programs and related problems: An overview

This page was built for publication: A cutting plane algorithm for solving bilinear programs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4124613)