NASA Logo

NTRS

NTRS - NASA Technical Reports Server

Back to Results
The Number of Support Constraints for Overlapping Set Optimization with Nested Admissible Sets Is Equal to OneThis paper reports on the formalization of a recent result by Crespo, et al., as found in the references. The formalized result bounds the number of support constraints in a particular type of optimization problem. The problem involves discovering an optimal member of a family of sets that overlaps each member of a constraining collection of sets. The particular case addressed here concerns optimizations in which the family of sets is nested. The primary results were formalized in the interactive theorem prover PVS and support the claim that a single support constraint exists in very general circumstances.
Document ID
20180008440
Acquisition Source
Langley Research Center
Document Type
Technical Memorandum (TM)
Authors
Siratt, John
(Universities Space Research Association (USRA) Hampton, VA, United States)
Crespo, Luis
(NASA Langley Research Center Hampton, VA, United States)
Narkawicz, Anthony
(NASA Langley Research Center Hampton, VA, United States)
Munoz, Cesar
(NASA Langley Research Center Hampton, VA, United States)
Date Acquired
December 14, 2018
Publication Date
October 1, 2018
Subject Category
Numerical Analysis
Report/Patent Number
NASA/TM-2018-220117
NF1676L-31613
L-20973
Funding Number(s)
WBS: WBS 340428.02.20.07.01
Distribution Limits
Public
Copyright
Public Use Permitted.
No Preview Available