Lahore University of Management Sciences

DISC 322 – Optimization Methods in Management Science

Spring Semester 2020
Instructor Dr. Muhammad Tayyab
Room No. SDSB 4-0037
Office Hours Tuesday & Thursday (1100 hrs – 1230 hrs)
Email [email protected]
Telephone Ext: 5130
Admin Assistant Abdul Basit
TAs & Office Hours Haaris Cheema, Haris Jameel (Tuesday, Thursday 1045 hrs to 1145 hrs)
Course URL (if any) TBA

COURSE BASICS
Credit Hours 3
Lecture(s)/Lab(s) Nbr of Lec(s) Per Week 2 Duration 75 minutes
Tutorial (per week) Nbr of Lec(s) Per Week TBA Duration TBA

COURSE DESCRIPTION

This is a core course for undergraduate students majoring in Management Science. It is designed to provide students
with a sound conceptual understanding of the role that management science plays in the decision making process. The
course intends to build a strong theoretical foundation in the area of optimization that would not only help students
formulate optimization problems more effectively, but also benefit students in their research in graduate studies. It is
an advanced level course in developing mathematical models and understanding their application to management
problems. The emphasis is on models and techniques that are widely used in all industries and functional areas,
including operations, supply chain, finance, HR, and marketing. Specific topics covered in this course include: techniques
such as Linear programming (Simplex method, Tabular form, Big M method, Two Phase method, Revised Simplex,
Duality theory), Binary Programming, Integer Programming (Branch & Bound algorithm, Branch & Cut algorithm), Goal
programming, Multi objective optimization, Non-linear programming, Meta-heuristics, (Tabu search, Genetic
Algorithm, Simulated Annealing).

COURSE PREREQUISITE(S)

MATH 101, DISC 212

 Lahore University of Management Sciences

COURSE OBJECTIVE(S)

The course has following primary objectives:

1. Introduce students to the concept of model-driven decision-making in business
2. Familiarize students to the theoretical foundation of Mathematical Programming
3. Learn key techniques and topics in Advanced Optimization Methods. Introduce the area of Integer Programming including
solution methods and heuristics.
4. Develop student’s appreciation of role of mathematical models in environmental and social sustainability of businesses
5. Develop student’s ability to critically analyze a business problem, design and apply appropriate decision-support tools and
interpret the results generated from the tools

COURSE LEARNING OUTCOMES

Upon successful completion of the course, students should be able to:
1. Discuss advanced modeling techniques in the field of Mathematical Programming.
2. Implement these techniques using optimization tools
3. Setup and solve a range of optimization problems (Linear Programming, Goal Programming Multi Objective LP, Integer
Programming, Non-linear programing, etc.) by correctly recognizing constraints, decision variables and objective(s)
4. Effectively communicate their problem-solving approach, selected tool(s), results, limitations and implications to support
the decision maker

UNDERGRADUATE PROGRAM LEARNING GOALS & OBJECTIVES

General Learning Goals & Objectives
Goal 1 –Effective Written and Oral Communication
Objective: Students will demonstrate effective writing and oral communication skills
Goal 2 –Ethical Understanding and Reasoning
Objective: Students will demonstrate that they are able to identify and address ethical issues in an
organizational context.
Goal 3 – Analytical Thinking and Problem Solving Skills
Objective: Students will demonstrate that they are able to identify key problems and generate viable solutions.
Goal 4 – Application of Information Technology
Objective: Students will demonstrate that they are able to use current technologies in business and
management context.
Goal 5 – Teamwork in Diverse and Multicultural Environments
Objective: Students will demonstrate that they are able to work effectively in diverse environments.
Goal 6 – Understanding Organizational Ecosystems
Objective: Students will demonstrate that they have an understanding of Economic, Political, Regulatory, Legal,
Technological, and Social environment of organizations.

Major Specific Learning Goals & Objectives

Goal 7 (a) – Discipline Specific Knowledge and Understanding
Objective: Students will demonstrate knowledge of key business disciplines and how they interact including
application to real world situations. (including subject knowledge)
Goal 7 (b) – Understanding the “science” behind the decision-making process (for MGS Majors)
Objective: Students will demonstrate ability to analyze a business problem, design and apply appropriate
decision-support tools, interpret results and make meaningful recommendations to support the decision-maker
 Lahore University of Management Sciences
PROGRAM LEARNING GOALS AND COURSE LEARNING OBJECTIVES COURSE ASSESSMENT ITEM
OBJECTIVES
Goal 1 –Effective Written and Oral Students get a number of opportunities Only written skills* can be assessed in
Communication to learn and demonstrate these skills Quizzes, Mid-Term and Final, Project
throughout the course CLO 7 presentations will evaluate oral skills
Goal 2 –Ethical Understanding and Assignment
Reasoning
Goal 3 – Analytical Thinking and Problem Students get a number of opportunities Quizzes, Mid-Term, Final Exam and
Solving Skills to learn and demonstrate these skills Course Project
throughout the course CLO 2-6
Goal 4 – Application of Information Students will learn to design and Quizzes, Mid-Term, Final Exam and
Technology implement decision-support tools Course Project
primarily in Excel CLO 2
Goal 5 – Teamwork in Diverse and Course Project
Multicultural Environments
Goal 6 – Understanding Organizational Course Project
Ecosystems
Goal 7 (a) – Discipline Specific Knowledge Quizzes, Mid-Term and Final Exam
and Understanding (Subject Knowledge)
Goal 7 (b) – Understanding the “science” Students get a number of opportunities Quizzes, Mid-Term and Final Exam
behind the decision-making process to learn and demonstrate these skills
throughout the course CLO 1-6

TEXTBOOK(S)/SUPPLEMENTARY READINGS
Introduction to Operations Research (10th Edition) - Frederick S. Hillier, Gerald J. Lieberman
Engineering Optimization – Theory and Practice (4th Edition) – Singiresu S. Rao

Spreadsheet Modeling and Decision Analysis- Cliff T. Ragsdale

Operations Research: Applications and Algorithms- Wayne L. Winston

GRADING BREAKUP
Assignment(s): 10%
Class Participation: 15% (10% for attendance, 5% for surprise quizzes)
Quiz(es): 10%
Project: 10%
Midterm Examination: 25%
Final Examination: 30%
Note: Instructor has a right to reallocate 5% breakup to any of the above mentioned grading category.

EXAMINATION DETAIL
Yes/No: YES
Combine/ Separate: Separate
Midterm
Duration: 60 minutes
Exam
Preferred Date:
Exam Specifications: Closed Books/Closed Notes/No help sheet
 Lahore University of Management Sciences
Yes/No: YES
Combine/ Separate: Separate
Final Exam
Duration: 120 minutes
Exam Specifications: Closed Books/Closed Notes/No help sheet

CLASS POLICY
ATTENDANCE
1. Attendance in classes is highly recommended.
2. A student will be marked absent if he/she is 1 minute late and/or leaves the class before class ending time, i.e.
zero-minute policy will be applied. 4 absences (excluding petition) will lead to F grade.

QUIZZES
3. Quizzes provide an excellent opportunity for a quick feedback on how well students are grasping the concepts
discussed in sessions. They also allow students to pace their studies steadily, and save them from the stress of
Midterm and Final exams. Therefore, we will be conducting six major quizzes in this course and several surprise
(short) quizzes which will be a part of CP. So basically, you should expect a short quiz at the start/end of most of
our sessions. Consider this as an “announcement” for all short quizzes . Major quizzes will be occasionally
announced.
4. We will be dropping one major quiz (out of six) from the final grade (n-1 policy).
1. In case you miss a quiz for any genuine reason, you may submit a Missed-Quiz petition. However, only one missed
quiz petition is allowed in usual circumstances
2. Leaves approved by OSA may not necessarily result in quizzes being compensated. Such OSA approved petitions
may be adjusted through n-1 policy.

ASSIGNMNETS
1. There will be a total of 1-3 assignments
2. You may work in teams of maximum of two persons for your assignments
3. Detailed instructions will be provided for each assignment

PROJECT
1. Project will be done in teams
2. Teams will be developed by the instructor
3. Detailed instructions will be provided later

CELL PHONES AND SIMILAR DEVICES

1. Use of cell phones and similar devices is not permissible in the class sessions.
2. Your phones should not be visible or heard during the sessions
 Lahore University of Management Sciences
ACADEMIC INTEGRITY AND CODE OF CONDUCT
We expect integrity from you in all your academic undertakings, and also seek your assistance in collectively
upholding the standards of academic integrity at LUMS.

COURSE SCHEDULE *
RECOMMENDED
LECTURE TOPICS SESSION OBJECTIVES
READINGS
1 Course Introduction Overview, discussion on Course Outline
Different types of OR problems, Basic concepts in
Chapters 1,2,3-
2 Basic of Linear Programming Linear Programming, rehearsal of first three lectures
DISC 212
of DISC 212, Four properties of linear problems,
Basic concepts behind SM, Canonical vs Standard form
Basics of Linear
3 Introduction to Simplex Method of an LP, Properties of Standard form, Basic vs Non
Algebra
Basic variables
Simplex Method for LP in Algebra of SM, SM in tabular form, examples with Max
4 Chapter 4
standard form objective function
Unbounded problem, Multiple solutions, Tie breaking,
5 Tabular Simplex Method Chapter 4
Degeneracy, cycling,
Solving Min problems, handling variables that are un-
Simplex Method; Adaptations
6 Chapter 4 restricted in sign
to non-standard forms
Big M method, Two-Phase Method
Simplex Method; Adaptations
7 Chapter 4 Big M method, Two-Phase Method
to non-standard forms
Sensitivity analysis with Simplex Tableau and Solver
8 Sensitivity Analysis Chapter 4,5
output, Allowable increase/decrease
9 Sensitivity Analysis Chapter 4,5 Reduced costs, Shadow prices
Formulating LP in terms of vectors and matrices,
10 Revised Simplex Chapter 5
Comparing Simplex Method with Revised Simplex
Revised Simplex
11 Chapter 5 Solving LP using Revised Simplex
Revised Simplex
12 Chapter 5 Performing sensitivity analysis using Revised Simplex
Understanding mathematical theory behind the Dual
13 Duality Theory Chapter 6
LP problem, Formulating a Dual LP
Performing sensitivity analysis using Duality theory
14 Duality and Sensitivity Chapter 6
Mid-term Exam
15
Chapter 8
16 Goal Programming Introduction to Goal programming
Supplement
Chapter 8
17 Goal Programming using goal constraints in an LP
Supplement
Multiple Objective Linear
Chapter 8
18 Program (MOLP) Handling LP problems with more than one objectives
Supplement
Chapter 8 Solving MOLP problems, MiniMax Theorem for
19 Weighted MOLP
Supplement handling MOLP weights
 Lahore University of Management Sciences
Understanding complexity of problems having integer
20 Binary Optimization Models Chapter 12
restrictions for the variables
Binary Programming
21 Chapter 12 Use of Binary variables in modeling linear programs
Integer Programs (IP)
22 Chapter 12 Formulating and solving an Integer program
Branch and Bound/Cut
23 Algorithm Chapter 12 Using Branch and Bound algorithm to solve IP

Non-Linear programs
24 Chapter 13 Fundamentals of Non-linear programming
Classical Optimization To learn necessary and sufficient conditions of non-
Chapter 2
25 Techniques for Non-linear linear optimality. Developing Hessian Matrices and
(Eng. Opt 4th Ed.)
Problems understanding Kuhn-Tucker conditions
Obtaining optimal solutions of nonlinear problems
using quadratic optimization technique. Handling
Quadratic Method and Fuzzy Supplementary
26 fuzzy parameters and converting fuzzy inputs into
Programming material
equivalent crisp information through center of gravity
(COG) and signed distance methods
Evolutionary Algorithms /
27 Chapter 14 Genetic Algorithm, Simulated Annealing
Heuristics
28 Project Presentations