Dynamic Optimization Problems and Applications
{'Code': '07010000', 'Directorate': {'Abbreviation': 'ENG', 'LongName': 'Directorate For Engineering'}, 'Division': {'Abbreviation': 'ECCS', 'LongName': 'Div Of Electrical, Commun & Cyber Sys'}}
{'SignBlockName': 'Kristen M. Biggar, N-BioS', 'PO_EMAI': None, 'PO_PHON': None}
Recent developments on Stackelberg Games and Incentive Strategies are           adapted to develop a novel decomposition approach for the solution of           dynamic optimization problems.  The approach involves stage-wise                decomposition, and stems from the following observation:  "In the               dynamic programming approach to optimization, if the cost-to-go                 functions at every stage were known, then the solution of an N-stage            optimal control problem would be obtained by solving (in parallel) N            decoupled static (single stage) optimization problems."  Taking this            observation as a starting point, the principal investigators suggest            that even if the optimal cost-to-go functions are not known, one can            start with some initial guesses, solve the corresponding N static               optimization problems, update on the initial guesses using these                solutions, solve a new set of optimization problems,...and so on...,            until some convergence is achieved.  The research is to study various           aspects of this scheme, including its convergence properties,                   computational requirements, and feasibility, and apply it to an                 economic dispatch problem arising in power systems.
{'FirstName': 'Peter', 'LastName': 'Luh', 'PI_MID_INIT': 'B', 'PI_SUFX_NAME': None, 'PI_FULL_NAME': 'Peter B Luh', 'EmailAddress': 'peter.luh@uconn.edu', 'NSF_ID': '000092152', 'StartDate': '09/01/1985', 'EndDate': None, 'RoleCode': 'Principal Investigator'}
{'Name': 'University of Connecticut', 'CityName': 'STORRS', 'ZipCode': '062699018', 'PhoneNumber': '8604863622', 'StreetAddress': '438 WHITNEY RD EXTENSION UNIT 11', 'StreetAddress2': None, 'CountryName': 'United States', 'StateName': 'Connecticut', 'StateCode': 'CT', 'CONGRESSDISTRICT': '02', 'CONGRESS_DISTRICT_ORG': 'CT02', 'ORG_UEI_NUM': 'WNTPS995QBM7', 'ORG_LGL_BUS_NAME': 'UNIVERSITY OF CONNECTICUT', 'ORG_PRNT_UEI_NUM': None}
{'Name': None, 'CityName': None, 'StateCode': None, 'ZipCode': None, 'StreetAddress': None, 'CountryCode': None, 'CountryName': None, 'StateName': None, 'CountryFlag': None, 'CONGRESSDISTRICT': None, 'CONGRESS_DISTRICT_PERF': '""'}
{'Code': '145400', 'Text': 'SYSTEMS THEORY'}
{'url': 'https://www.nsf.gov/awardsearch/download?DownloadFileName=1985&All=true', 'xml': '8513163.xml'}