Finite method of minimizing a concave function under linear constraints and applications

DOI10.1007/BF01074782zbMath0626.90065OpenAlexW2000288121MaRDI QIDQ3030588

Tran Vu Thieu

Publication date: 1986

Published in: Cybernetics (Search for Journal in Brave)

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

zbMATH Keywords

bilinear programminglinear constraintsconcave function

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Sensitivity, stability, parametric optimization (90C31) Linear programming (90C05) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Cites Work

• 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 Conical Algorithm for Globally Minimizing a Concave Function Over a Closed Convex Set

This page was built for publication: Finite method of minimizing a concave function under linear constraints and applications