Bilinear programming: An exact algorithm

DOI10.1007/BF01593787zbMath0363.90086MaRDI QIDQ4138491

Aydin Ülkücü, Giorgio Gallo

Publication date: 1977

Published in: Mathematical Programming (Search for Journal in Brave)

Mathematics Subject Classification ID

Quadratic programming (90C20)

Related Items

Bilinear programming and structured stochastic games, Bilevel linear programming, Bilevel and multilevel programming: A bibliography review, Multiple phase tabu search for bipartite Boolean quadratic programming with partitioned variables, Disjoint Bilinear Optimization: A Two-Stage Robust Optimization Perspective, A note on the solution of bilinear programming problems by reduction to concave minimization, On a new class of bilevel programming problems and its use for reformulating mixed integer problems, A reducibility method for the weak linear bilevel programming problems and a case study in principal-agent, Jointly constrained bilinear programs and related problems: An overview, Accelerating convergence of cutting plane algorithms for disjoint bilinear programming, 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, Degeneracy removal in cutting plane methods for disjoint bilinear programming, Generalized bilinear programming. I: Models, applications and linear programming relaxation, Two-stage robust optimization approach to elective surgery and downstream capacity planning, A global supply chain model with transfer pricing and transportation cost allocation, Optimization of linear-convex programs, Nondifferentiable reverse convex programs and facetial convexity cuts via a disjunctive characterization, Dynamic slope scaling procedure and Lagrangian relaxation with subproblem approximation, 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, Test problem construction for linear bilevel programming problems, The maximization of a function over the efficient set via a penalty function approach, A simple SLP algorithm for solving a class of nonlinear programs, 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

Cites Work

• Nonlinear Programming: Counterexamples to Two Global Optimization Algorithms
• Intersection Cuts—A New Type of Cutting Planes for Integer Programming
• Convexity Cuts and Cut Search
• Unnamed Item
• Unnamed Item
• Unnamed Item