Concept
Schönhardt polyhedron
Related lectures (23)
Convex Concave Configuration
Demonstrates the process of including beams and correcting orientations for complex configurations.
Linear Programming Basics
Covers the basics of linear programming, defining corners, extreme points, and feasible solutions within polyhedrons.
Solving Linear Programs: SIMPLEX Method
Explains the SIMPLEX method for solving linear programs and optimizing the solution through basis variable manipulation.
Linear Programming Basics
Covers the basics of linear programming and the simplex method, focusing on finding optimal solutions and handling degeneracy.
Integer Optimization: Theory and Applications
Covers the fundamentals of integer optimization, including integer programming, dynamic programming, and approximation algorithms.
Linear Programming Duality
Explores Linear Programming Duality, covering weak duality, strong duality, Lagrange multipliers interpretation, and optimization constraints.
Convex Sets: Theory and Applications
Explores convex sets, their properties, and applications in optimization.
Convex Optimization Problems
Covers Convex Optimization Problems, LP formulations, and practical implementations using CVXPY and GUROBI.
Regular Polyhedra: Symmetries & Generation
Explores the properties of regular polyhedra, their symmetries, generation, and historical misconceptions.
Integer Programs: Optimization and Constraints
Explores integer programs, nonconvex optimization, constraints, and geometric aspects of linear programming for optimal solutions.