Spring 2026 - Math 354 - Sections 02/04

View original course

33 study materials · 9 sections

Math 354: Linear Optimization provides a comprehensive introduction to the mathematical theory and application of linear programming. The course covers the transition from foundational linear algebra concepts, such as matrix inversion and linear independence, to advanced optimization techniques including the Simplex method and Duality theory. Students learn to model real-world constraints, solve problems geometrically in two dimensions, and apply algebraic methods for higher-dimensional challenges. Assessment is conducted through a mastery-based grading system that emphasizes conceptual understanding and procedural accuracy.

Course Sections

Linear Algebra Review and Matrix Operations

Key concepts: Reduced Row Echelon Form (RREF) · Matrix Inversion · Linear Independence · Linear Combinations · Vector Spaces

A foundational review of linear algebra techniques essential for optimization, focusing on matrix inversion and vector space properties.

Linear Programming Fundamentals: Standard and Canonical Forms

Key concepts: Standard Form · Canonical Form · Optimization Constraints · Non-negativity Constraints · Transformation Techniques

Introduction to the structure of Linear Programming Problems (LPPs) and the mathematical requirements for standard and canonical representations.

Graphical Optimization and the Geometric Method

Key concepts: Feasible Region · Extreme Point Theorem · Level Curves · Vertices · Boundedness

Solving 2D linear programming problems using geometric visualization, feasible regions, and level curves.

Basic Feasible Solutions (BFS) and Slack Variables

Key concepts: Slack Variables · Basic Variables · Non-basic Variables · Basic Feasible Solution (BFS) · Linearly Independent Columns

Bridging the gap between geometry and algebra by identifying vertices through matrix subsets.

The Simplex Method and Tableau Optimization

Key concepts: Simplex Tableau · Pivot Selection · Optimality Criterion · Entering and Leaving Variables · Iterative Improvement

The primary algorithmic approach for solving linear programming problems using iterative pivoting.

The Two-Phase Method and Artificial Variables

Key concepts: Artificial Variables · Phase I · Phase II · Infeasibility Detection

Handling problems where an initial basic feasible solution is not immediately obvious.

Duality in Linear Programming

Key concepts: Primal Problem · Dual Problem · Weak Duality Theorem · Duality Theorem · Shadow Prices

Exploring the relationship between a 'Primal' problem and its 'Dual' counterpart.

Applied Optimization: The Diet Problem

Key concepts: Cost Minimization · Nutritional Constraints · Standard Form Conversion · Real-world Modeling

A classic application of linear programming to minimize costs while meeting nutritional requirements.

Assessment and Mastery-Based Learning

Key concepts: Mastery Rubric · Self-Reflection · Error Classification · Conceptual Understanding

Guidelines on how student performance is evaluated through rubrics and self-reflection.

Source Materials

Study Spring 2026 - Math 354 - Sections 02/04 on Lykke

This course page is free to open: signed out, you can read its first two sections, and signing in, on any plan, opens the rest. The free Lykke Chrome extension syncs your own Canvas courses, so ChatGPT, Claude and Muse can answer from your classes and deadlines. It only reads Canvas.

Add the free extensionSign in to open every section

Browse more course pages