MGMT 295 - Management Science

This is an introductory course in the techniques of management science. It explains with a minimum of mathematics how to formulate decision problems, how to solve them, and how to apply the solutions obtained. Fundamental management problems such as determining an optimal allocation of an organization's limited resources among competing demands are examined. The application of computers to solve management science problems is demonstrated.


Credits: 3


Hours: 45 (Lecture Hours: 2;  Laboratory Hours: 1)


Total Weeks: 15



MGMT 290 or MATH 104


Non-Course Prerequisites:






Course Content:
- Introduction to Management Science & Linear Programming
- LP and Sensitivity Analysis
- LP and Simplex Method
- Maximization and Minimization
- Postoptimality Analysis
- Transportation and Assignment Problems
- Integer Programming
- Midterm Exam
- Goal Programming
- Decision Theory
- Forecasting
- Inventory Models
- Networks, CPM and PERT
- Queuing Models and Simulation
- Markov Analysis and Information Systems
- Final Exam


Learning Outcomes:
Upon successful completion of this course, the student should be able to:
- Define management science and outline its characteristics;
- Identify the uses and limitations of management science techniques;
- List the steps of the scientific method, and the six-step management science process;
- Define a system and describe its structure, differentiate between its efficiency and effectiveness;
- Describe the components of a mathematical model, outline various types of models;
- Explain what linear programming (LP) is, and list its components;
- Solve LP problems graphically and interpret the;
- Explain how sensitivity analysis can be useful to a decision maker, use this technique to evaluate a change in the value of an objective function coefficient and in the RHS of a constraint;
- Discuss the role computers play in solving simplex problems and the relevance of manual solutions;
- Solve maximization and minimization problems and interpret those solutions;
- Read and interpret the solution to a dual problem, and relate the dual solution to the primal solution;
- Use the assignment and transportation methods to solve integer problems;
- Use graphical, and branch and bound methods to solve integer problems;
- Explain what a goal is and how it is expressed in a goal programming model;
- Formulate goal programming models and solve them using a graphical approach and with computer software;
- Describe and give examples of decisions under certainty, risk, and complete uncertainty
- Construct a payoff table, use decision trees to lay out decision alternatives;
- Determine the expected value of perfect information;
- Describe and use a variety of forecasting techniques to make forecasts;
- List and briefly describe the information requirements of inventory management, and material requirements planning (MRP);
- Use appropriate formulas to compute order quantities, when to re-order, safety stocks, service levels, and expected amounts of shortages;
- Describe the kinds of problems that can be solved using the shortest route algorithm and use it to solve typical "network" problems;
- Construct simple network diagrams, analyze various networks;
- List the kinds of information that a PERT or CPM analysis can provide, use these analyses in project management problems;
- Identify the appropriate queuing model needed to solve a problem;
- Differentiate between analytical techniques and simulations, conduct manual and computer simulations;
- Describe the kinds of system behaviors that Markov analysis pertains to;
- Use a tree diagram and matrix multiplication (by computer also) to analyze system behavior;
-. Contrast the terms data and information;
- Explain what a management information system (MIS) is and the various kinds of reports that such systems can supply to decision makers, differentiate an MIS system from a decision support system (DSS) an an expert system.


Grading System: Letters


Passing Grade: D (50%)


Percentage of Individual Work: 100


Textbooks are subject to change.  Please contact the bookstore at your local campus for current book lists.