A note on the solution of bilinear programming problems by reduction to concave minimization
From MaRDI portal
DOI10.1007/BF01580766zbMATH Open0643.90054OpenAlexW2020689565MaRDI QIDQ1102190FDOQ1102190
Authors: 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
Recommendations
- scientific article; zbMATH DE number 1461826
- A finite algorithm for concave minimization over a polyhedron
- A new reformulation-linearization technique for bilinear programming problems
- A linear programming approach to solving bilinear programmes
- Finite method of minimizing a concave function under linear constraints and applications
Numerical mathematical programming methods (65K05) Linear programming (90C05) Sensitivity, stability, parametric optimization (90C31)
Cites Work
- Convex Analysis
- A bilinear programming formulation of the 3-dimensional assignment problem
- Jointly Constrained Biconvex Programming
- Two-person nonzero-sum games and quadratic programming
- Title not available (Why is that?)
- A cutting plane algorithm for solving bilinear programs
- Optimal Facility Location with Concave Costs
- Equilibrium Points of Bimatrix Games
- A linear max—min problem
- A Conical Algorithm for Globally Minimizing a Concave Function Over a Closed Convex Set
- A finitely convergent algorithm for bilinear programming problems using polar cuts and disjunctive face cuts
- The bilinear programming problem
- Bilinear programming: An exact algorithm
- A cutting plane algorithm for the bilinear programming problem
- An outer approximation method for globally minimizing a concave function over a compact convex set
- Relationship between bilinear programming and concave minimization under linear constraints
- A finite algorithm for concave minimization over a polyhedron
- 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
- Title not available (Why is that?)
Cited In (28)
- Title not available (Why is that?)
- The inverse optimal value problem
- Efficient algorithms for solving rank two and rank three bilinear programming problems
- Disjoint Bilinear Optimization: A Two-Stage Robust Optimization Perspective
- A computational analysis of LCP methods for bilinear and concave quadratic programming
- The maximization of a function over the efficient set via a penalty function approach
- Title not available (Why is that?)
- Mathematical programming and the sensitivity of multi-criteria decisions
- Accelerating convergence of cutting plane algorithms for disjoint bilinear programming
- A note on reduction of quadratic and bilinear programs with equality constraints
- A new reformulation-linearization technique for bilinear programming problems
- LP-based approximations for disjoint bilinear and two-stage adjustable robust optimization
- On decomposition in bilinear programming
- Task assignment with controlled and autonomous agents
- Generalized bilinear programming. I: Models, applications and linear programming relaxation
- Bilinear separation of two sets in \(n\)-space
- Bilevel optimization applied to strategic pricing in competitive electricity markets
- Bilinear minimax problems with linear constraints: Theory and numerical experiment
- Finite method of minimizing a concave function under linear constraints and applications
- A linear programming approach to solving bilinear programmes
- Optimization of linear-convex programs
- On reduction of some multifold minimax problems with coupled constraints
- Title not available (Why is that?)
- Dynamic slope scaling procedure and Lagrangian relaxation with subproblem approximation
- On Reducibility in Bilevel Problems
- A simple SLP algorithm for solving a class of nonlinear programs
- LP-based approximations for disjoint bilinear and two-stage adjustable robust optimization
- On the minimization of a quasi-concave function subject to linear constraints
This page was built for publication: A note on the solution of bilinear programming problems by reduction to concave minimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1102190)
