Algorithms to solve some problems of concave programming with linear constraints

DOI10.1134/S0005117907030034zbMath1118.49025OpenAlexW1976610274MaRDI QIDQ2371599

S. I. Sergeev

Publication date: 5 July 2007

Published in: Automation and Remote Control (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s0005117907030034

zbMATH Keywords

approximate algorithmsconcave objective functionprecise algorithms

Mathematics Subject Classification ID

Cites Work

• Deterministic methods in constrained global optimization: Some recent advances and new fields of application
• A Survey and Comparison of Methods for Finding All Vertices of Convex Polyhedral Sets
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Algorithms to solve some problems of concave programming with linear constraints