A cutting plane algorithm for solving bilinear programs
From MaRDI portal
Publication:4124613
DOI10.1007/BF01580367zbMath0353.90069MaRDI QIDQ4124613
Publication date: 1976
Published in: Mathematical Programming (Search for Journal in Brave)
Related Items
Calculating a minimal sphere containing a polytope defined by a system of linear inequalities, A new branch-and-cut algorithm for non-convex quadratic programming via alternative direction method and semidefinite relaxation, On a stochastic bilevel programming problem, Reformulation of mathematical programming problems as linear complementarity problems and investigation of their solution methods, Bilinear modeling solution approach for fixed charge network flow problems, Continuous quadratic programming formulations of optimization problems on graphs, Decomposition methods for solving a class of nonconvex programming problems dealing with bilinear and quadratic functions, Disjoint Bilinear Optimization: A Two-Stage Robust Optimization Perspective, Capacitated, balanced, sequential location-allocation problems on chains and trees, A decomposition approach for global optimum search in QP, NLP and MINLP problems, Semidefinite programming hierarchies for constrained bilinear optimization, A note on the solution of bilinear programming problems by reduction to concave minimization, A hierarchical approach for sparse source blind signal separation problem, On characterizing linear complementarity problems as linear programs, LP-based approximations for disjoint bilinear and two-stage adjustable robust optimization, Penalty function approach to linear trilevel programming, An FPTAS for optimizing a class of low-rank functions over a polytope, An augmented Lagrangian based semismooth Newton method for a class of bilinear programming problems, 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, A reducibility method for the weak linear bilevel programming problems and a case study in principal-agent, An effective global algorithm for worst-case linear optimization under polyhedral uncertainty, On engineering game theory with its application in power systems, Jointly constrained bilinear programs and related problems: An overview, 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, On the convergence of the block nonlinear Gauss-Seidel method under convex constraints, A computational analysis of LCP methods for bilinear and concave quadratic programming, Hierarchical optimization: An introduction, Optimization over the efficient set, Efficient algorithms for solving rank two and rank three bilinear programming problems, Robust location transportation problems under uncertain demands, The complementary convex structure in global optimization, New global algorithms for quadratic programming with a few negative eigenvalues based on alternative direction method and convex relaxation, The continuity of two functions associated with a maximin problem with connected variables, A multilevel bilinear programming algorithm for the vertex separator problem, Degeneracy removal in cutting plane methods for disjoint bilinear programming, A copositive approach for two-stage adjustable robust optimization with uncertain right-hand sides, Generalized bilinear programming. I: Models, applications and linear programming relaxation, Mixed-integer bilinear programming problems, On the indefinite quadratic bilevel programming problem., A new reformulation-linearization technique for bilinear programming problems, A global supply chain model with transfer pricing and transportation cost allocation, Optimization of linear-convex programs, A linear programming approach to solving bilinear programmes, Linear multiplicative programming, Cyclic seesaw process for optimization and identification, Maximization of A convex quadratic function under linear constraints, On the solution of NP-hard linear complementarity problems, The inverse optimal value problem, A study of local solutions in linear bilevel programming, Separable concave minimization via partial outer approximation and branch and bound, Dynamic slope scaling procedure and Lagrangian relaxation with subproblem approximation, An exact penalty method for weak linear bilevel programming problem, A finitely convergent algorithm for bilinear programming problems using polar cuts and disjunctive face cuts, Two-Stage Optimization Problems with Multivariate Stochastic Order Constraints, Two-stage network constrained robust unit commitment problem, Subdeterminants and Concave Integer Quadratic Programming, Sum of Squares Certificates for Containment of $\mathcal{H}$-Polytopes in $\mathcal{V}$-Polytopes, Generation of disjointly constrained bilinear programming test problems, An exact penalty on bilevel programs with linear vector optimization lower level, Generalized bilinear programming: An application in farm management, The maximization of a function over the efficient set via a penalty function approach, Estimating heterogeneous agent preferences by inverse optimization in a randomized nonatomic game, New product introduction against a predator: A bilevel mixed-integer programming approach, Global optimization from concave minimization to concave mixed variational inequality, Enhanced intersection cutting-plane approach for linear complementarity problems, Location of a conservative hyperplane for cutting plane methods in disjoint bilinear programming, The value of shape constraints in discrete moment problems: a review and extension, On the global minimization of concave functions, Linear, quadratic, and bilinear programming approaches to the linear complementarity problem, Global optimization algorithms for linearly constrained indefinite quadratic problems, A simplex approach for finding local solutions of a linear bilevel program by equilibrium points
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Two-person nonzero-sum games and quadratic programming
- Nonlinear Power of Adjacent Extreme Point Methods in Linear Programming
- Equilibrium Points in Finite Games
- Maximization of A convex quadratic function under linear constraints
- A linear max—min problem
- Nonlinear Programming: Counterexamples to Two Global Optimization Algorithms
- Equilibrium Points of Bimatrix Games
- A method for solving maximum-problems with a nonconcave quadratic objective function
- On Connections Between Zero-One Integer Programming and Concave Programming Under Linear Constraints
- Solving Certain Nonconvex Quadratic Minimization Problems by Ranking the Extreme Points
