Other functions:a major challenge in the multidisciplinary design analysis and optimization (MDAO) field is the high labor effort required to setup a complex analysis model. The advent of a new…

Ended Awarded

Contract number
NNL12AB69T
Awardee
Awarding agency
Obligated
$90,747

Award facts

Contract value 100% obligated
$90,747.00 Current and potential, with all options
Completion date 100% complete
Current and potential, with all options
NAICS code
541712 Research and Development in the Physical, Engineering, and Life Sciences (except Biotechnology)
PSC
AR11 Space R&D Services; Space Flight, Research And Supporting Activities; Basic Research
Set-aside
No set-aside
Competition
Not Competed · 1 offer Negotiated Proposal / Quote
Pricing
Cost Plus Fixed Fee
Place of performance
Hampton, VA 23666, USA

Award details come from SAM.gov/FPDS.

Description

Other functions:a major challenge in the multidisciplinary design analysis and optimization (MDAO) field is the high labor effort required to setup a complex analysis model. The advent of a new generation of MDAO frameworking tools has encouraged engineers to build systems analyses with increasing numbers of different software tools. When models get large, the work involved in linking up all of the inputs and outputs between codes can get very large. This linking process can be thought of as building up the data dependency graph for the system. In some cases, there may not even been a single unique data dependency graph since multiple graphs could all be feasible. This already hard problem is made more difficult when you consider the use of multi-level MDAO optimization architectures, such as BLISS2000 or analytical target cascading, on such large systems analyses. Thus IT is necessary to establish a set of algorithms and tools, backed by established graph theoretic approaches, to manage the complexity in large models and reduce the time and labor costs of their initial setup. Research objectives the objectives of this research are to: investigate the representation of MDAO problems, and their data dependencies, using directed cyclic graphs (DCG) and directed acyclic graphs (DAG). Develop a set of graph manipulation techniques to determine feasible dags from a given DCG investigate possible methods of selecting a particular DAG from a set of possible dags, given a certain user/modeler defined goal for the simulation (e.g. lowest computational time, highest parallelization, most hierarchical design integrate the developed graph manipulation techniques into the openmdao framework and demonstrate their effectiveness at reducing setup cost on a test problem.

Quick answers

Who was awarded contract NNL12AB69T?

NNL12AB69T was awarded to National Institute Of Aerospace Associates by Langley Research Center (National Aeronautics and Space Administration) on April 6, 2012.

How much is contract NNL12AB69T worth?

The government has obligated $90,747 on NNL12AB69T.

Is contract NNL12AB69T an order under another contract?

Yes. NNL12AB69T is a delivery order under NNL08AA00B, an indefinite delivery contract.

Was contract NNL12AB69T competed?

The extent of competition for NNL12AB69T was not competed. The government received 1 offer.

On GovTribe

See this award's full record

  • Every transaction and funding action
  • The awardee's other awards and teaming partners
  • Similar awards and recompete opportunities
  • Ask GovTribe AI about this award