The Transhipment Problem: Standard Form

About
Privacy
Disclaimer

Graph Chatbot

Related lectures (31)

Page 2 of 4

The Transhipment Problem: Total Unimodularity

Covers the transhipment problem, the incidence matrix, and total unimodularity.

Introduction to Optimization and Operations Research

Covers fundamental concepts of optimization and operations research, exploring real-world examples and key topics over a semester.

Linear Optimization: Finding Initial BFS

Explains the process of finding an initial Basic Feasible Solution for linear optimization problems using the Simplex Algorithm.

Max-Flow Min-Cut

Explores the Ford Fulkerson algorithm, Max-Flow Min-Cut theorem, Incidence matrix, and network optimization complexity.

The Simplex Algorithm: Efficiency and Degeneracy

Covers the Simplex Algorithm, focusing on efficiency and degeneracy in linear optimization problems.

Linear Optimization: Auxiliary Problem

Explores the formulation of the auxiliary problem in linear optimization and its role in optimal decision-making.

Approximation Algorithms

Covers approximation algorithms for optimization problems, LP relaxation, and randomized rounding techniques.

Support Vector Machines: SVM Basics

Covers the basics of Support Vector Machines, focusing on hard-margin and soft-margin formulations.

Semi-Definite Programming

Covers semi-definite programming and optimization over positive semidefinite cones.

Linear Programming Basics

Introduces linear programming basics, including optimization problems, cost functions, simplex algorithm, geometry of linear programs, extreme points, and degeneracy.