A convex programming with nested constraints on the amount of resources
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1766752
- On an optimization problem with nested constraints
- A New Combinatorial Algorithm for Separable Convex Resource Allocation with Nested Bound Constraints
- Solving nested-constraint resource allocation problems with an interior point method
- Convex optimization problems with constraints
- scientific article; zbMATH DE number 4197770
- Publication:4732313
- scientific article; zbMATH DE number 2208557
- scientific article; zbMATH DE number 3856836
- scientific article; zbMATH DE number 3898632
Cites work
- Convex Analysis
- scientific article; zbMATH DE number 544186 (Why is no real title available?)
- scientific article; zbMATH DE number 1766752 (Why is no real title available?)
- Optimal Search for a Moving Target in Discrete Time and Space
- Search for a Moving Target: The FAB Algorithm
- Theory of optimal search
Cited in
(6)- Solving nested-constraint resource allocation problems with an interior point method
- scientific article; zbMATH DE number 1547881 (Why is no real title available?)
- scientific article; zbMATH DE number 1766752 (Why is no real title available?)
- A New Combinatorial Algorithm for Separable Convex Resource Allocation with Nested Bound Constraints
- On an optimization problem with nested constraints
- Problems with resource allocation constraints and optimization over the efficient set
This page was built for publication: A convex programming with nested constraints on the amount of resources
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3427663)