1. Single-Objective Optimization

1. Single-Objective Optimization

• Overview: Focuses on optimizing a single performance criterion or objective, such as minimizing weight or maximizing strength.

• Techniques:

     ○ Gradient-Based Optimization: Uses the gradient of the objective function to find the local optimum. 

     ○ Suitable for problems with continuous and differentiable functions.

     ○ Genetic Algorithms (GA): A heuristic method inspired by natural selection that is effective for complex, non-linear optimization problems.

     ○ Simulated Annealing: A probabilistic technique that explores the solution space by mimicking the annealing process in metallurgy, useful for avoiding local minima.

• Use Cases: When a single performance criterion is of primary importance, and trade-offs are less critical.

2. Multi-Objective Optimization

• Overview: Simultaneously optimizes multiple objectives, providing a set of optimal solutions known as the Pareto front.

• Techniques:

     ○ Pareto Optimization: Finds a set of non-dominated solutions where no other solution is better in all objectives, helping to visualize trade-offs between conflicting goals.

     ○ Weighted Sum Method: Combines multiple objectives into a single composite objective by assigning weights, then optimizing the weighted sum.

     ○ Evolutionary Algorithms: Extends genetic algorithms to handle multiple objectives, particularly effective in finding diverse solutions across the Pareto front.

Use Cases: When balancing trade-offs between competing objectives is critical, such as minimizing cost while maximizing performance.

3. Constrained Optimization

Overview: Involves optimizing an objective function subject to a set of constraints, such as physical limits, regulatory requirements, or design specifications.

Techniques:Penalty Methods: Converts constraints into penalty terms added to the objective function, penalizing constraint violations.

Barrier Methods: Prevents the solution from crossing constraint boundaries by adding barrier functions.

Lagrange Multipliers: Directly incorporates constraints into the optimization process, often used in gradient-based methods.

Use Cases: Ideal when design constraints are strict and must be adhered to, such as material strength limits or maximum allowable stress.

4. Global Optimization

Overview: Aims to find the global optimum in a design space that may contain multiple local optima, which is especially important for complex, non-linear problems.

Techniques:Genetic Algorithms (GA): Efficient for exploring large and complex design spaces to avoid being trapped in local optima.

Simulated Annealing: Useful for problems where the design space is rugged with many local optima.

Particle Swarm

Optimization (PSO): A population-based stochastic optimization technique inspired by the social behavior of birds flocking, good for global searches.

Use Cases: When the design space is complex and global optimality is crucial, such as in the design of innovative or cutting-edge technologies.