Skip to main content
Graph
Search
fr
en
Login
Search
All
Categories
Concepts
Courses
Lectures
MOOCs
People
Practice
Publications
Startups
Units
Show all results for
Home
Lecture
Discrete Optimization: Traveling Salesman Problem
Graph Chatbot
Related lectures (32)
Optimal Decision Making: Sensitivity Analysis
Covers sensitivity analysis in linear programming, focusing on optimal solutions and their sensitivities to changes.
Optimization with Constraints: Theory and Applications
Covers the theory and applications of optimization with constraints, including key concepts and numerical methods.
Relations Between Events
Explores relations between events, disjunctive constraints, and modeling with binary variables in optimization problems.
Quadratic Penalty Methods: Sound Problems
Explores Quadratic Penalty Methods for optimization with enforced constraints using penalty functions.
Introduction to Optimization and Operations Research
Covers fundamental concepts of optimization and operations research, exploring real-world examples and key topics over a semester.
Introduction to Optimization
Introduces linear algebra, calculus, and optimization basics in Euclidean spaces, emphasizing the power of optimization as a modeling tool.
Two-phase Simplex Algorithm: Introduction and Duality
Introduces the two-phase simplex algorithm and explores duality in linear programming.
Cutset Formulation: MST Problem
Explores the cutset formulation for the MST Problem and Gomory Cutting Planes method.
Linear Constraints: Elimination of Variables
Explains linear constraints and variable elimination in optimization problems, illustrating the process step by step.
Single Inequality or Equality Constraint
Covers single inequality or equality constraints and necessary optimality conditions in optimization problems.
Statistical Physics: Spin Glasses & Optimization
Explores the Curie-Weiss model, spin glasses, and optimization problems in statistical physics.
Linear Programming Basics
Introduces linear programming basics, including optimization problems, cost functions, simplex algorithm, geometry of linear programs, extreme points, and degeneracy.
Previous
Page 2 of 2
Next