arrow_back
Back
lock
Introduction
lock
Scope of the Course
lock
Ex - Why Study OR
lock
LPP - Linear Programming Problems
lock
What are Optimization Problems
lock
Mathematical Formulation of LPP
lock
Steps for Solving LPP
lock
LPP Formulation
lock
How to Draw Graphs
lock
Numerical Based on Graphical Method
lock
Shortcut Slope Method
lock
Binding Constraints _ Special Cases
lock
LPP Analytical (Simplex) Method
lock
Numerical Based on Simplex Method
lock
Transportation Problems
lock
What are Transportation Problems
lock
Allocations
lock
North-West Corner Rule or DENTZY_s
lock
Vogel_s Approximation Method (VAM)
lock
Numerical on Transportation Problems
lock
Assignment Problems
lock
Understanding Assignment Problems
lock
Hungarian Method or Flood Technique
lock
Numerical on Assignment Problem
lock
Solving Maximization Transportation
lock
Sequencing
lock
The Appropriate Order
lock
SPT - Shortest Processing Time
lock
EDD - Earliest Due Date
lock
n Jobs in 2 Machines
lock
Numerical on n Jobs in 2 Machines
lock
Queuing Theory
lock
MAthematical Study of Queues
lock
Why is Queung Theory Important
lock
Kendall Notation
lock
Important Formulae
lock
Numerical on Queuing Theory
lock
PERT & CP< - Network Analysis
lock
Project, Activity _ Event
lock
Rules for Network Diagram
lock
Types of Network Diagram
lock
How to Make a Network Diagram
lock
Network Analysis
lock
CPM - Critical Path Methods
lock
Computational Approach of CPM
lock
PERT - Program Evaluation Review Tech
lock
Numerical on PERT Analysis
Preview - Industrial Engineering - Operations Research
Discuss (
0
)
navigate_before
Previous
Next
navigate_next