We're still actively developing this site. If you encounter any issues, please report them! - Report an issue

DYNAMIC PROGRAMMING AND ASSOCIATED TOPICS

COMPSCI/ISYE 723
Course Description

General and special techniques of dynamic programming developed by means of examples. Shortest-path algorithms. Deterministic equipment replacement models. Resource allocation problem. Traveling-salesman problem. Knapsack problem. Analysis of inventory systems. General stochastic formulations. Markovian decision processes. Students are strongly encouraged to have knowledge of mathematical optimization (e.g.,COMP SCI/​I SY E/​MATH/​STAT  525,I SY E 623,COMP SCI/​I SY E/​MATH/​STAT  726), knowledge of analysis (e.g.,MATH/​STAT  431or521) and programming ability (e.g.,COMP SCI 200or 301)

Prerequisites

Graduate/professional standing

Satisfies

This course does not satisfy any prerequisites.

Credits

Not Reported

Offered

Not Reported

Grade Point Average
3.95

10.52% from Historical

Completion Rate
100%

No change from Historical

A Rate
90.91%

28.18% from Historical

Class Size
22

71.63% from Historical

Cumulative Grade Distribution

Instructors (2026 Summr)

Sorted by ratings from Rate My Professors

Similar Courses

INTRODUCTION TO COMBINATORIAL OPTIMIZATION

COMPSCI/ISYE/MATH 425

Focuses on optimization problems over discrete structures, such as shortest paths, spanning trees, flows, matchings, and the traveling salesman problem. We will investigate structural properties of these problems, and we will study both exact methods for their solution, and approximation algorithms.

ADVANCED LINEAR PROGRAMMING

COMPSCI/ISYE 526

Review of linear programming. Polynomial time methods for linear programming. Quadratic programs and linear complementarity problems and related solution techniques. Solution sets and their continuity properties. Error bounds for linear inequalities and programs. Parallel algorithms for linear and quadratic programs.

SPECIAL TOPICS IN OPERATIONS RESEARCH

ISYE 823

Subjects vary.

STOCHASTIC PROGRAMMING

COMPSCI/ISYE 719

Stochastic programming is concerned with decision making in the presence of uncertainty, where the eventual outcome depends on a future random event. Topics include modeling uncertainty in optimization problems, risk measures, stochastic programming algorithms, approximation and sampling methods, and applications. Students are strongly encouraged to have knowledge of linear programming (e.g.,MATH/​COMP SCI/​I SY E/​STAT  525) and probability and statistics (e.g.,MATH/​STAT  431). Knowledge of integer optimization (MATH/​COMP SCI/​I SY E  728) is helpful, but not required.

OPERATIONS RESEARCH-DETERMINISTIC MODELING

ISYE 323

Basic techniques for modeling and optimizing deterministic systems with emphasis on linear programming. Computer solution of optimization problems. Applications to production, logistics, and service systems.