A cutting plane algorithm for solving bilinear programs

Cites work

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?)
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
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

(78)

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

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)