Upon successful completion of the course, students should be able to:

1. Describe fundamentals of basic linear algebra, matrix operations, gauss-jordan elimination, linear optimization.

2. Formulate mathematical models of the optimization problems.

3. Solve linear programs using graphical methods and simplex algorithm and perform post-optimality analysis.

4. Solve integer programs using branch-and-bound and cutting plane algorithms.

5. Solve transportation, transhhipment, problems using transportation simplex method and assignment problems using Hungarian method.

6. Solve network optimization problems: shortest path, minimum spanning tree, maximum flow, and CPM/PERT problems.

7. Perform discrete event simulation.

8. Apply and use LINDO, LINGO, What’s Best, and Microsoft Excel softwares to solve linear and integer programming models and interpret the program outputs.