Program Overview

Program Overview

The program focuses on optimization methods and their applications. Optimization, also known as mathematical programming, is a mathematical technique used for decision-making. It involves finding the best solution among a set of possible solutions that satisfy given conditions.

Program Details

• The program covers various topics, including:
  • Introduction to optimization
  • Unconstrained optimization
  • Constrained optimization
  • Convex programming
  • Network programming
  • Combinatorial optimization
  • Integer programming

Course Outline

The program consists of 14 lectures, each covering a specific topic in optimization:

1. Introduction to optimization and unconstrained optimization
2. Unconstrained optimization (continued)
3. Unconstrained optimization (continued)
4. Unconstrained optimization (continued)
5. Unconstrained optimization (continued) and introduction to constrained optimization
6. Constrained optimization (continued)
7. Convex programming
8. Convex programming (continued)
9. Convex programming (continued)
10. Network programming
11. Network programming (continued) and combinatorial optimization
12. Combinatorial optimization (continued) and integer programming
13. Integer programming (continued)
14. Exercise problems

Recommended Lectures

• Computer System Overview
• Introduction to Modern Mathematics for Engineering (Mathematical Methods V)
• Media Programming Introduction
• Understanding Life Systems - Rapidly Evolving Life Sciences (Academic Overview Lecture)
• Geometry II
• Administrative Science (2003)
• Survey and Cooperation