Approximate method of solving concave programming problems

DOI10.1016/0041-5553(82)90145-8zbMATH Open0509.90064OpenAlexW1981121609MaRDI QIDQ4749604FDOQ4749604

Authors: B. M. Mukhamediev 

Publication date: 1982

Published in: USSR Computational Mathematics and Mathematical Physics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0041-5553(82)90145-8

zbMATH Keywords

boundaryoptimal solutionconcave minimizationapproximate methodlocal minimum

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25)

Cited In (1)

• Quasiconjugates of functions, duality relationship between quasiconvex minimization under a reverse convex constraint and quasiconvex maximization under a convex constraint, and applications

This page was built for publication: Approximate method of solving concave programming problems

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