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

ADVANCED LINEAR PROGRAMMING

COMPSCI/ISYE 526
Course Description

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.

Prerequisties

COMPSCI/ISYE/MATH/STAT 525 and (COMPSCI 200 , COMPSCI 220 , COMPSCI 300 , 301, 302, COMPSCI 310 , or placement into COMPSCI 300 ) or graduate/professional standing

Satisfies

This course does not satisfy any prerequisites.

Credits

Not Reported

Offered

Not Reported

Grade Point Average
2.81

2.27% from Historical

Completion Rate
100%

14.29% from Historical

A Rate
37.5%

50% from Historical

Class Size
8

50% from Historical

Instructors (2025 Fall)

Sorted by ratings from Rate My Professors

Similar Courses

DYNAMIC PROGRAMMING AND ASSOCIATED TOPICS

COMPSCI/ISYE 723

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)

ADVANCED ALGORITHMS

COMPSCI 787

Advanced paradigms for the design and analysis of efficient algorithms, including the use of randomness, linear programming, and semi-definite programming. Applications to data structures, approximating NP-hard optimization problems, learning, on-line and distributed problems. Students are strongly encouraged to have introductory knowledge of algorithms (e.g.,COMP SCI 577)

LINEAR OPTIMIZATION

COMPSCI/ISYE/MATH/STAT 525

Introduces optimization problems whose constraints are expressed by linear inequalities. Develops geometric and algebraic insights into the structure of the problem, with an emphasis on formal proofs. Presents the theory behind the simplex method, the main algorithm used to solve linear optimization problems. Explores duality theory and theorems of the alternatives.

INTEGER OPTIMIZATION

COMPSCI/ISYE/MATH 728

Introduces optimization problems over integers, and surveys the theory behind the algorithms used in state-of-the-art methods for solving such problems. Special attention is given to the polyhedral formulations of these problems, and to their algebraic and geometric properties. Applicability of Integer Optimization is highlighted with applications in combinatorial optimization. Key topics include: formulations, relaxations, polyhedral theory, cutting planes, decomposition, enumeration. Students are strongly encouraged to have knowledge of Linear Programming (e.g.,MATH/​COMP SCI/​I SY E/​STAT  525), including algorithms, duality and polyhedral theory.

INTRODUCTION TO OPTIMIZATION

COMPSCI/ECE/ISYE 524

Introduction to mathematical optimization from a modeling and solution perspective. Formulation of applications as discrete and continuous optimization problems and equilibrium models. Survey and appropriate usage of basic algorithms, data and software tools, including modeling languages and subroutine libraries.