A finite method for globally minimizing concave functions over unbounded polyhedral convex sets and its applications

zbMath0597.90069MaRDI QIDQ1079499

Tran Vu Thieu

Publication date: 1984

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

zbMATH Keywords

computational experienceone additional constraintsequence of linearly constrained concave minimization problems

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Methods of successive quadratic programming type (90C55)

Related Items

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