MATH 354 - OperationsResearch

Institution:

Shepherd University

Subject:

Description:

An introduction to main topics of operations research: linear programming, network optimization, dynamic programming, and queueing theory. The simplex algorithm will be studied in detail, including duality theory and sensitivity analysis. In network optimization the OSPF algorithm, PERT, and CPM will be considered. Examples of applications from industry, notably some queueing algorithms. Additional topics may be chosen from Markov chains, integer programming, nonlinear programming, game theory and decision analysis, and simulation. Prerequisite: MATH 155 and MATH 207 or MATH 254.

Credits:

3.00

Credit Hours:

Prerequisites:

Corequisites:

Exclusions:

Level:

Instructional Type:

Lecture

Notes:

Additional Information:

Historical Version(s):

Institution Website:

WWW.SHEPHERD.EDU

Phone Number:

(304) 876-5000

Regional Accreditation:

North Central Association of Colleges and Schools

Calendar System:

Semester

The Course Profile information is provided and updated by third parties including the respective institutions. While the institutions are able to update their information at any time, the information is not independently validated, and no party associated with this website can accept responsibility for its accuracy.