A convex programming with nested constraints on the amount of resources

DOI10.1080/00207160601071254zbMath1116.65066OpenAlexW2093669194MaRDI QIDQ3427663

Ryusuke Hohzaki

Publication date: 23 March 2007

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207160601071254

zbMATH Keywords

numerical examplesconvex programmingsearch theoryresource allocation problem

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Management decision making, including multiple objectives (90B50)

Cites Work

• Unnamed Item
• Unnamed Item
• Theory of optimal search
• Search for a Moving Target: The FAB Algorithm
• Optimal Search for a Moving Target in Discrete Time and Space
• Convex Analysis

This page was built for publication: A convex programming with nested constraints on the amount of resources