100% Plagiarism-Free
+1-727-416-5453

Sign In

Access your dashboard and order activity.

Forgot password?

Create Account

Register to place orders and track every step.

MSOM 9102

Linear and Discrete Optimization

Temple University 3 credits MSOM

Course Description

We will introduce linear programming and integer programming methods in this course. This course will cover how to model large-size problems using linear programming and integer programming and solve them using solvers such as CPLEX. In this course, we will also discuss various research papers with applications of linear programming and integer programming models. This class will also cover the theory and applications of combinatorial optimization. We will introduce graphical and network modeling of problems in transportation and distribution, facility location, communication, scheduling, and staff assignment. Topics include minimum cost spanning trees, the greedy algorithm and matroid theory, network flows, maximal matching, vehicle routing algorithms, computational complexity, total dual integrality, and polyhedral combinatorics.

Code
MSOM 9102
Credits
3
Subject
MSOM

Programs That Include This Course

Get expert help with MSOM 9102 Linear and Discrete Optimization

Our subject experts help with essays, research papers, case studies, discussion posts, and capstone projects for these programs β€” written from scratch to your course requirements.

Get Help Now

Program and course information is reproduced from each university's published academic catalog for informational purposes and may change. Always confirm current requirements with your university. We are an independent academic support service and are not affiliated with or endorsed by the universities listed.

Academic Resources

Latest from the Blog

Expert guides on essay writing, citation styles, study skills, and academic success.

View All Articles