Efficient Asset Allocation to Dynamic Requests for Support

This letter details two novel algorithms for computing asset allocations given dynamic requests for support. Using spatial and temporal discretization, the first algorithm casts the allocation problem as a lexicographic integer-linear program (ILP) that is efficiently solved using an ILP solver. Imp...

Full description

Saved in:
Bibliographic Details
Published in:IEEE control systems letters 2024, Vol.8, p.2577-2582
Main Authors: Elliott, D. Sawyer, Finn, Connor, Hicks, Greg
Format: Article
Language:English
Subjects:
Approximation algorithms
asset allocation
Dynamic scheduling
Heuristic algorithms
integer-linear programming
linear programming
Optimization
Physics
Research and development
Resource allocation
Resource management
Robots
Space missions
Surveillance
Citations: Items that this one cites
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This letter details two novel algorithms for computing asset allocations given dynamic requests for support. Using spatial and temporal discretization, the first algorithm casts the allocation problem as a lexicographic integer-linear program (ILP) that is efficiently solved using an ILP solver. Improving computational efficiency, the second algorithm replaces the ILP solver with a novel dual-tactic linear program solver. Provided proofs, complexity analyses, and numerical analyses demonstrate the computational efficiency and convergence of both algorithms to performant solutions. Discussion of application to broad domains such as defense, conservation, and resource management for businesses is provided.
ISSN:2475-1456
2475-1456
DOI:10.1109/LCSYS.2024.3503472