Skip to main content

Module 4 Exam Prep Checklist & Formula Guide

Quick Summary - High-yield exam revision package for Module 4: Design of Experiments and Optimization Methods. Use this checklist and master formula sheet for rapid self-assessment, memory consolidation, and formula verification prior to university examinations.


1. High-Yield Conceptual Checklist​

Review each syllabus topic below. Click the topic titles to jump directly to the detailed theoretical lectures and derivations.

Section A: DOE Principles & Standard Designs​

  • Foundations of Experimental Design:
    • Define Factor, Level, Response, Treatment, and Experimental Unit.
    • State and explain Fisher's 3 Fundamental Principles: Replication, Randomization, and Local Control (Blocking).
    • Differentiate between true replication and repeated measurements.
    • Memorize the 7-step sequence of designing a valid scientific experiment.
  • Standard Experimental Designs & ANOVA:
    • Understand conditions for Completely Randomized Design (CRD) (homogeneous units, 1-way ANOVA).
    • Understand conditions for Randomized Block Design (RBD) (1 nuisance gradient, 2-way ANOVA).
    • Understand conditions for Latin Square Design (LSD) (2 orthogonal nuisance sources, p×pp \times p matrix, 3-way ANOVA without interactions).
    • Construct ANOVA tables from scratch (Degrees of freedom, Sum of Squares, Mean Squares, and FcalF_{\text{cal}}).
    • Master the ANOVA Decision Rule: If Fcal>Ftab(α,df1,df2)F_{\text{cal}} > F_{\text{tab}}(\alpha, \text{df}_1, \text{df}_2), reject H0H_0.
    • Full Factorial 2k2^k designs: Compute contrasts (CC), estimated effects (C/2k−1rC / 2^{k-1}r), and sum of squares (C2/2krC^2 / 2^k r).

Section B: Taguchi Methodology & Robust Parameter Design​

  • Fractional Factorials & Taguchi Robust Design:
    • Explain drawbacks of Full Factorials (N=LkN = L^k run explosion, sparsity of effects).
    • Define Fractional Factorial designs (2k−p2^{k-p}) and confounding/aliasing.
    • State Dr. Genichi Taguchi's definition of Quality ("Loss imparted to society from shipment").
    • Write and calculate Taguchi's Quality Loss Function (QLF): L(y)=k(y−m)2L(y) = k(y - m)^2.
    • Contrast traditional "goalpost" tolerances with Taguchi continuous quadratic loss.
    • Explain the 3-step design method: System Design, Parameter Design, Tolerance Design.
    • Differentiate Control Factors, Noise Factors, and Signal Factors.
    • Define Orthogonal Arrays (OAs) (L4,L8,L9,L16,L27L_4, L_8, L_9, L_{16}, L_{27}) and identify why factor level balances eliminate correlation.
    • Memorize the 3 Signal-to-Noise (S/NS/N) ratio formulas:
      • Larger-the-better (LTB)
      • Smaller-the-better (STB)
      • Nominal-the-best (NTB)
    • Remember: Always MAXIMIZE the S/NS/N ratio, regardless of objective.
    • Execute an L9L_9 response table, identify optimal factor combinations, and project predicted optimum performance: S/N‾pred=S/N‾+∑(S/N‾opt−S/N‾)\overline{S/N}_{\text{pred}} = \overline{S/N} + \sum (\overline{S/N}_{\text{opt}} - \overline{S/N})

Section C: Response Surface Methodology & Optimization​

  • RSM Fundamentals & First-Order Modeling:
    • Memorize the Canonical 10-Step Methodological Framework of RSM:
      1. Define the Problem (Objective: Maximize, Minimize, or Target).
      2. Select Response Variable(s) (YY).
      3. Identify Factors and Levels (Coded levels: Low −1-1, Center 00, High +1+1).
      4. Select Experimental Design (CCD / BBD).
      5. Conduct Experiments according to design matrix and record responses.
      6. Fit the Mathematical Model (Y=β0+β1X1+β2X2Y = \beta_0 + \beta_1 X_1 + \beta_2 X_2).
      7. Analyze the Model using statistical tests (ANOVA, FF-value, pp-value, R2R^2, Adjusted R2R^2, Lack-of-Fit).
      8. Study the Response Surface (Contour plots, 3D surface plots).
      9. Determine the Optimum Conditions (Steepest ascent path / stationary point x0\mathbf{x}_0).
      10. Conduct Confirmation Experiments (Validate predicted vs. actual responses).
    • Calculate 1st-order regression coefficients (β0=∑YN,βj=∑XjYN\beta_0 = \frac{\sum Y}{N}, \beta_j = \frac{\sum X_j Y}{N}).
    • Execute the Method of Steepest Ascent along gradient ∇Y=[β1,β2]T\nabla Y = [\beta_1, \beta_2]^T with proportional step conversions.
  • RSM Designs: Central Composite & Box-Behnken:
    • Understand Central Composite Design (CCD) point structure: Factorial (2k2^k) + Star (2k2k) + Center (ncn_c).
    • Calculate total runs in CCD: N=2k+2k+ncN = 2^k + 2k + n_c (e.g., k=2,nc=5  ⟹  N=13k=2, n_c=5 \implies N = 13).
    • Derive star distance for rotatability: α=(2k)1/4\alpha = (2^k)^{1/4} (2≈1.414\sqrt{2} \approx 1.414 for k=2k=2).
    • Convert coded star coordinates (±α)(\pm \alpha) into physical engineering settings.
    • Understand Box-Behnken Design (BBD): Edge midpoints with strictly 3 levels (−1,0,+1-1, 0, +1).
    • Calculate total runs in BBD: N=2k(k−1)+ncN = 2k(k - 1) + n_c (e.g., k=3,nc=3  ⟹  N=15k=3, n_c=3 \implies N = 15).
    • Explain why BBD is safer for hazardous processes (omits extreme factorial corners and out-of-range star points).
    • Reproduce the comparison matrix between CCD and BBD.
  • RSM: Multi-Response Optimization (MRO):
    • Formulate linear desirability functions for Larger-the-better (dY=Y−Ymin⁡Ymax⁡−Ymin⁡d_Y = \frac{Y - Y_{\min}}{Y_{\max} - Y_{\min}}) and Smaller-the-better (dR=Rmax⁡−RRmax⁡−Rmin⁡d_R = \frac{R_{\max} - R}{R_{\max} - R_{\min}}).
    • Compute overall composite desirability via geometric mean: D=(d1×⋯×dk)1/kD = (d_1 \times \dots \times d_k)^{1/k}.
    • Explain the Zero-Product Rule: if any di=0d_i = 0, D=0D = 0.
    • Solve multi-response trade-off problems balancing competing criteria (e.g., Yield vs. Roughness).
  • Global Optimization & Metaheuristics Taxonomy:
    • Define the 5 components of an optimization problem: Decision Variables, Objective Function, Constraints, Parameters, and Algorithm.
    • Differentiate between a Local Optimum and a Global Optimum.
    • Define Heuristic vs. Metaheuristic; explain the balance between Exploration (Diversification) and Exploitation (Intensification).
    • Reproduce the 5-Branch Taxonomy Tree:
      1. Evolutionary: GA, DE, GP, ES.
      2. Physics-Based: SA, GSA, HS, MA.
      3. Swarm-Based: PSO, ACO, ABC, FSA.
      4. Bio-Inspired: AIS, BFO, DCA, KHA.
      5. Nature-Inspired: CS, FA, BA, IWO.
  • Genetic Algorithms (GA):
    • Explain Darwin's "Survival of the Fittest", chromosomes, genes, and population.
    • Detail the 7 execution stages: Chromosome formation, population init, fitness evaluation, selection, crossover, mutation, and elitist replacement.
    • Perform a manual 1-generation GA calculation maximizing f(x)=x2f(x) = x^2 with 5-bit strings.
  • Physics & Swarm Algorithms: SA & PSO:
    • Simulated Annealing (SA): Physical metallurgy analogy (Heating, Isothermal, Cooling), Metropolis acceptance probability: P=exp⁡(−ΔET)P = \exp\left(-\frac{\Delta E}{T}\right) Geometric cooling schedule (T←αTT \leftarrow \alpha T).
    • Particle Swarm Optimization (PSO): Swarm dynamics, personal best (pbesti\mathbf{pbest}_i), global best (gbest\mathbf{gbest}), velocity update equation (ww, c1c_1, c2c_2), position update equation.

2. Master Formula Cheatsheet​

1. Analysis of Variance (ANOVA) Layouts​

Correction Factor: CF=G2N,Total SS: SST=∑y2−CF\text{Correction Factor: } CF = \frac{G^2}{N}, \quad \text{Total SS: } \text{SST} = \sum y^2 - CF

Experimental DesignTreatment SS (SSTreat\text{SSTreat})Blocking / Gradient SSError SS (SSE\text{SSE})Error Degrees of Freedom (dfError\text{df}_{\text{Error}})
CRD (tt treat, rr rep)∑Ti2r−CF\sum \frac{T_i^2}{r} - CFNoneSST−SSTreat\text{SST} - \text{SSTreat}N−t=t(r−1)N - t = t(r - 1)
RBD (tt treat, rr blocks)∑Ti2r−CF\sum \frac{T_i^2}{r} - CFSSBlock=∑Bj2t−CF\text{SSBlock} = \sum \frac{B_j^2}{t} - CFSST−SSTreat−SSBlock\text{SST} - \text{SSTreat} - \text{SSBlock}(t−1)(r−1)(t - 1)(r - 1)
LSD (p×pp \times p square)∑Ti2p−CF\sum \frac{T_i^2}{p} - CFSSRow=∑Rj2p−CF\text{SSRow} = \sum \frac{R_j^2}{p} - CF
SSCol=∑Ck2p−CF\text{SSCol} = \sum \frac{C_k^2}{p} - CF
SST−SSTreat−SSRow−SSCol\text{SST} - \text{SSTreat} - \text{SSRow} - \text{SSCol}(p−1)(p−2)(p - 1)(p - 2)

Test Statistic: Fcal=MSTreatMSE=SSTreat/dfTreatSSE/dfErrorF_{\text{cal}} = \frac{\text{MSTreat}}{\text{MSE}} = \frac{\text{SSTreat} / \text{df}_{\text{Treat}}}{\text{SSE} / \text{df}_{\text{Error}}}


2. 2k2^k Full Factorial Design Formulas​

Contrast: C=∑i=12k±yi+,Estimated Effect: E^=C2k−1⋅r,Sum of Squares: SSE=C22k⋅r\text{Contrast: } C = \sum_{i=1}^{2^k} \pm y_{i+}, \quad \text{Estimated Effect: } \hat{E} = \frac{C}{2^{k-1} \cdot r}, \quad \text{Sum of Squares: } \text{SS}_E = \frac{C^2}{2^k \cdot r}


3. Taguchi Robust Design Formulas​

  • Quality Loss Function: L(y)=k(y−m)2,where k=Cost at Specification LimitΔ2L(y) = k(y - m)^2, \quad \text{where } k = \frac{\text{Cost at Specification Limit}}{\Delta^2}
  • Signal-to-Noise Ratios (dB):
    • Larger-the-Better (LTB): η=−10log⁡10(1n∑i=1n1yi2)→n=120log⁡10(y)\eta = -10 \log_{10}\left(\frac{1}{n}\sum_{i=1}^n \frac{1}{y_i^2}\right) \quad \xrightarrow{n=1} \quad 20 \log_{10}(y)
    • Smaller-the-Better (STB): η=−10log⁡10(1n∑i=1nyi2)\eta = -10 \log_{10}\left(\frac{1}{n}\sum_{i=1}^n y_i^2\right)
    • Nominal-the-Best (NTB): η=10log⁡10(yˉ2s2)\eta = 10 \log_{10}\left(\frac{\bar{y}^2}{s^2}\right)
  • Predicted Optimum Performance: S/N‾pred=S/N‾overall+∑j=1k(S/N‾j,opt−S/N‾overall)\overline{S/N}_{\text{pred}} = \overline{S/N}_{\text{overall}} + \sum_{j=1}^k \left(\overline{S/N}_{j, \text{opt}} - \overline{S/N}_{\text{overall}}\right)

4. Response Surface & Desirability Formulas​

  • First-Order Planar Model & Orthogonal Coefficient Estimation: Y=β0+∑i=1kβiXi,β0=∑YiN,βj=∑XjiYiNY = \beta_0 + \sum_{i=1}^k \beta_i X_i, \quad \beta_0 = \frac{\sum Y_i}{N}, \quad \beta_j = \frac{\sum X_{ji} Y_i}{N}
  • Steepest Ascent Gradient Direction: ∇Y=[β1β2…βk]T\nabla Y = \begin{bmatrix} \beta_1 & \beta_2 & \dots & \beta_k \end{bmatrix}^T
  • Second-Order Quadratic Model: y=β0+∑i=1kβixi+∑i=1kβiixi2+∑i<jβijxixj+ϵy = \beta_0 + \sum_{i=1}^k \beta_i x_i + \sum_{i=1}^k \beta_{ii} x_i^2 + \sum_{i < j} \beta_{ij} x_i x_j + \epsilon
  • Derringer-Suich Overall Desirability: D=(d1×d2×⋯×dm)1m=(∏i=1mdi)1mD = \left(d_1 \times d_2 \times \dots \times d_m\right)^{\frac{1}{m}} = \left(\prod_{i=1}^m d_i\right)^{\frac{1}{m}}

5. Metaheuristic Governing Formulas​

  • Simulated Annealing Metropolis Criterion: ΔE=Enew−Ecurrent,P={1if ΔE≤0exp⁡(−ΔET)if ΔE>0\Delta E = E_{\text{new}} - E_{\text{current}}, \quad P = \begin{cases} 1 & \text{if } \Delta E \le 0 \\ \exp\left(-\frac{\Delta E}{T}\right) & \text{if } \Delta E > 0 \end{cases} Cooling Schedule: Tk+1=αTk(0.8≤α<1)\text{Cooling Schedule: } T_{k+1} = \alpha T_k \quad (0.8 \le \alpha < 1)
  • Particle Swarm Optimization (PSO) Updates: Vit+1=wVit+c1r1(pbesti−Xit)+c2r2(gbest−Xit)\mathbf{V}_i^{t+1} = w \mathbf{V}_i^t + c_1 r_1 \left(\mathbf{pbest}_i - \mathbf{X}_i^t\right) + c_2 r_2 \left(\mathbf{gbest} - \mathbf{X}_i^t\right) Xit+1=Xit+Vit+1\mathbf{X}_i^{t+1} = \mathbf{X}_i^t + \mathbf{V}_i^{t+1}

tip

Next Step for Practice

Proceed to the Module 4 Solved Practice Problems to test your calculation speed on complete numerical examination questions.