Linear and Nonlinear Programming

Submitted by admin on Mon, 04/05/2015 - 16:37
Course Type: 
Εlective Course
ID: 
M153
ECTS: 
8
Credits: 
4
Semester : 
Winter
Credit hours (lecture): 
4
Credit hours (discussion): 
0
Credit hours (lab): 
0
Instructor: 
Kolliopoulos Stavros

Convex sets, polyhedra, cones. Minkowski-Weyl theorem. Duality. Faces and facets of polyhedra. Total unimodularity. Total dual integrality. The matching polytope. Extended formulations.