Assignment 5

Published

March 11, 2024

Abstract
Exploration of MDO architectures and their implementation

Due: 19-04-2024

Problem Statement

minimize  x12+x2+y1+ey2  w.r.t  z1,x1,x2  such that  y1=z12+x1+x20.2y2  y2=y1+z1+x2    y22410  1y13.160    10z110  0x110  0x210

The global optimum is located at (z1,x1,x2)=(1.9776,0,0).

So this question seems straight forward. Solve the problem using MDF, IDF and AAO architectures.

Questions

  1. Clearly state the mathematical formulation of each architecture and the results obtained.
  2. Compare the performance of the different architectures in terms of convergence and computational cost.
  3. Experiment with different initial guesses for each problem and comment on the robustness of each architecture.
  4. Comment on the ease of implementation and the potential for parallelization of each architecture.

Deliverables

  • A pdf report with source code and a discussion of your implementation methodology and results.