MML-13-07: Quadratic Programming (QP), Linear Programming (LP) & ML Solvers – Practice Quiz

30 worked single-select and multiselect questions on Quadratic Programming (QP), Linear Programming (LP) & ML Solvers. Cognitive level: Tier 2–3. Prerequisites: QS 13.6.

Develop conceptual understanding, step-by-step computations, ML diagnostics and the assigned theoretical derivations. Each explanation analyzes every choice by its content.

Learning objectives: Classify LP, convex QP and nonconvex quadratic formulations. Convert inequalities, bounds and auxiliary variables into solver forms. Calculate exact LP and QP optima and stationarity systems. Formulate hard-margin and soft-margin SVM programs. Explain feasible logarithmic barriers and central-path certificates. Explain SMO pair updates and constraint preservation. Diagnose infeasibility, unboundedness, conditioning and solver output.

Study references: Boyd & Vandenberghe, Convex Optimization, Sections 4.3–4.4 and 11.2–11.3; Platt, Sequential Minimal Optimization, Sections 1–2.