A cutting plane algorithm for the bilinear programming problem
From MaRDI portal
Publication:4149217
DOI10.1002/nav.3800240107zbMath0372.90082OpenAlexW2109798263MaRDI QIDQ4149217
Publication date: 1977
Published in: Naval Research Logistics Quarterly (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/nav.3800240107
Related Items
Decomposition methods for solving a class of nonconvex programming problems dealing with bilinear and quadratic functions, A note on the solution of bilinear programming problems by reduction to concave minimization, 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, Efficient algorithms for solving rank two and rank three bilinear programming problems, Degeneracy removal in cutting plane methods for disjoint bilinear programming, 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, The inverse optimal value problem, Dynamic slope scaling procedure and Lagrangian relaxation with subproblem approximation, A finitely convergent algorithm for bilinear programming problems using polar cuts and disjunctive face cuts, Subdeterminants and Concave Integer Quadratic Programming, Generation of disjointly constrained bilinear programming test problems, A simple SLP algorithm for solving a class of nonlinear programs, Enhanced intersection cutting-plane approach for linear complementarity problems, Location of a conservative hyperplane for cutting plane methods in disjoint bilinear programming, Linear, quadratic, and bilinear programming approaches to the linear complementarity problem, Global optimization algorithms for linearly constrained indefinite quadratic problems
Cites Work
