Approximate method of solving concave programming problems

From MaRDI portal

Jump to:navigation, search

DOI10.1016/0041-5553(82)90145-8MaRDI QIDQ4749604zbMATH OpenOpenAlexFDO

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

boundary optimal solution concave minimization approximate method local 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)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Approximate_method_of_solving_concave_programming_problems&oldid=90036044"