Relationship between bilinear programming and concave minimization under linear constraints

zbMath0486.90061MaRDI QIDQ1165155

Tran Vu Thieu

Publication date: 1980

Published in: Acta Mathematica Vietnamica (Search for Journal in Brave)

zbMATH Keywords

bilinear programming problemconcave piecewise linear minimization problem under linear constraintsconvex linear complementarity problemequivalence of problemsequivalent reformulation

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Linear programming (90C05) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Related Items (10)

A composite branch and bound, cutting plane algorithm for concave minimization over a polyhedron ⋮ 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 ⋮ On the global minimization of a convex function under general nonconvex constraints ⋮ A finite method for globally minimizing a concave function over an unbounded polyhedral convex set and its applications ⋮ Finite method of minimizing a concave function under linear constraints and applications ⋮ Separable concave minimization via partial outer approximation and branch and bound ⋮ A branch and bound-outer approximation algorithm for concave minimization over a convex set ⋮ On the global minimization of concave functions ⋮ Global optimization algorithms for linearly constrained indefinite quadratic problems

This page was built for publication: Relationship between bilinear programming and concave minimization under linear constraints