Global optimality theorem for spatial dynamic programming
Conference
·
OSTI ID:6411656
Spatial dynamic programing is an approach for solving large-scale optimization problems for systems consisting of sparsely interconnected subsystems. The interactions are not assumed to be weak. It is shown that only a weak form of separability of the objective function is necessary to guarantee the global optimality of the solution; the proof explains why systems with sparse interactions are the best candidates for this method. 7 references.
- Research Organization:
- Georgia Inst. of Tech., Atlanta (USA); Systems Control, Inc., Palo Alto, CA (USA)
- OSTI ID:
- 6411656
- Report Number(s):
- CONF-781005-4
- Country of Publication:
- United States
- Language:
- English
Similar Records
Decision and control in large-scale systems via spatial dynamic programming
Regulation of Dynamical Systems to Optimal Solutions of Semidefinite Programs: Algorithms and Applications to AC Optimal Power Flow
Conference
·
Fri Dec 31 23:00:00 EST 1976
·
OSTI ID:6380272
Regulation of Dynamical Systems to Optimal Solutions of Semidefinite Programs: Algorithms and Applications to AC Optimal Power Flow
Conference
·
Wed Jul 01 00:00:00 EDT 2015
·
OSTI ID:1225022
Related Subjects
20 FOSSIL-FUELED POWER PLANTS
200100 -- Fossil-Fueled Power Plants-- Power Plants & Power Generation
99 GENERAL AND MISCELLANEOUS
990200* -- Mathematics & Computers
ALLOCATIONS
CONTROL THEORY
DYNAMIC PROGRAMMING
ECONOMETRICS
ECONOMICS
ELECTRIC UTILITIES
MANAGEMENT
OPERATION
OPTIMIZATION
PUBLIC UTILITIES
RESOURCES
200100 -- Fossil-Fueled Power Plants-- Power Plants & Power Generation
99 GENERAL AND MISCELLANEOUS
990200* -- Mathematics & Computers
ALLOCATIONS
CONTROL THEORY
DYNAMIC PROGRAMMING
ECONOMETRICS
ECONOMICS
ELECTRIC UTILITIES
MANAGEMENT
OPERATION
OPTIMIZATION
PUBLIC UTILITIES
RESOURCES