Brief Introduction to Integer and Combinatorial Optimization
Duration: 3 h
Integer programs form a class of optimization models, in which some or all of the decision variables may only take integer values. Many practical problems in a variety of application domains (e.g., economics, transportation, logistics, bioinformatics, and health care) may be modeled and solved integer programs. The lecture will discuss basic approaches used for formulating and solving linear as well as some classes of nonlinear integer programs. We will also briefly overview several well-known applications of integer and combinatorial optimization.
Prerequisites: Undergraduate-level Linear Algebra course.
Dr. Oleg Prokopyev
Place of employment: Department of Industrial Engineering, University of Pittsburgh, USA. Specialist in sphere of Operations Research, Combinatorial Optimization, Integer Programming, Stochastic Programming.
Spheres of science researches: combinatorial optimization, integer programming, stochastic programming, computational complexity, applications of operations research in health care and bioinformatics.