A note on the solution of bilinear programming problems by reduction to concave minimization

DOI10.1007/BF01580766zbMath0643.90054OpenAlexW2020689565MaRDI QIDQ1102190

Tran Vu Thieu

Publication date: 1988

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01580766

zbMATH Keywords

concave minimizationbilinear programmingouter-approximation algorithm

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Sensitivity, stability, parametric optimization (90C31) Linear programming (90C05)

Related Items (17)

Disjoint Bilinear Optimization: A Two-Stage Robust Optimization Perspective ⋮ LP-based approximations for disjoint bilinear and two-stage adjustable robust optimization ⋮ Task assignment with controlled and autonomous agents ⋮ On the minimization of a quasi-concave function subject to linear constraints ⋮ Accelerating convergence of cutting plane algorithms for disjoint bilinear programming ⋮ A computational analysis of LCP methods for bilinear and concave quadratic programming ⋮ Generalized bilinear programming. I: Models, applications and linear programming relaxation ⋮ A new reformulation-linearization technique for bilinear programming problems ⋮ Bilevel optimization applied to strategic pricing in competitive electricity markets ⋮ Optimization of linear-convex programs ⋮ A linear programming approach to solving bilinear programmes ⋮ The inverse optimal value problem ⋮ Dynamic slope scaling procedure and Lagrangian relaxation with subproblem approximation ⋮ 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 ⋮ Mathematical programming and the sensitivity of multi-criteria decisions ⋮ Bilinear separation of two sets in \(n\)-space

Cites Work

• Unnamed Item
• Unnamed Item
• An outer approximation method for globally minimizing a concave function over a compact convex set
• On outer approximation methods for solving concave minimization problems
• A finite method for globally minimizing concave functions over unbounded polyhedral convex sets and its applications
• Relationship between bilinear programming and concave minimization under linear constraints
• Two-person nonzero-sum games and quadratic programming
• Jointly Constrained Biconvex Programming
• A Conical Algorithm for Globally Minimizing a Concave Function Over a Closed Convex Set
• A finite algorithm for concave minimization over a polyhedron
• A finitely convergent algorithm for bilinear programming problems using polar cuts and disjunctive face cuts
• A bilinear programming formulation of the 3-dimensional assignment problem
• The bilinear programming problem
• A cutting plane algorithm for solving bilinear programs
• Bilinear programming: An exact algorithm
• A cutting plane algorithm for the bilinear programming problem
• A linear max—min problem
• Optimal Facility Location with Concave Costs
• Equilibrium Points of Bimatrix Games
• Convex Analysis

This page was built for publication: A note on the solution of bilinear programming problems by reduction to concave minimization