Linear programming applications covering introduction to LP (allocation of limited resources, linear functions), terminology (cost/profit coefficients, technological coefficients, resource coefficients, decision variables), transportation problem, marketing research problem, model example (TechEdge Company PC manufacturing, LP formulation, graphical solution method, corner point analysis, optimal solution determination), important terms (constraint boundary, corner-point solutions, feasible solution, infeasible solution, feasible region, CPF solution, adjacent solutions).
Introduction to operations research covering course introduction, genesis of OR (WWII origins, post-war growth), features of OR (scientific method/research, search for optimality, algorithmic, cross-functional, broad applicability), steps in OR implementation, important problem features (decision variables, parameters, objective function types, constraints, relevant data), formulation of mathematical model, solving and testing model, application, prerequisites (elementary row operations, Gaussian reduction), characteristics of OR, examples.
Queuing theory fundamentals covering arrival and service distributions, Kendall’s notation, operating characteristics, Poisson queuing models, and steady-state analysis.
Game theory solution methods covering saddle point determination, dominance concept, pure and mixed strategies, and solution rules for games.
Duality in linear programming covering primal-dual relationships, shadow prices, economic interpretation, conversion rules, and primal-dual theorems.