Relationship between bilinear programming and concave minimization under linear constraints

MaRDI QIDQ1165155zbMATH OpenFDO

Authors 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

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

Cited in

(10)

• Separable concave minimization via partial outer approximation and branch and bound
• Decomposition methods for solving a class of nonconvex programming problems dealing with bilinear and quadratic functions
• On the global minimization of concave functions
• Global optimization algorithms for linearly constrained indefinite quadratic problems
• On the global minimization of a convex function under general nonconvex constraints
• A note on the solution of bilinear programming problems by reduction to concave minimization
• A composite branch and bound, cutting plane algorithm for concave minimization over a polyhedron
• Finite method of minimizing a concave function under linear constraints and applications
• A finite method for globally minimizing a concave function over an unbounded polyhedral convex set and its applications
• A branch and bound-outer approximation algorithm for concave minimization over a convex set

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1165155)