Toggle Side Panel
Close search
Course Content
UNIT I -LECTURE NOTES-Linear Programming Problem
Linear Programming - Formulation - Graphical method and Simplex Method - Formation of Primal and Dual.
0/3
LPP
00:00
Graphical Method
00:00
Operation Research
UNIT 2 -LECTURE NOTES-Transportation Problems and Assignment Problems
Transportation Problems: NWC - LCM - VAM - Starting Solution - MODI method - Optimal solution ᎓ balanced and unbalanced Transportation problems (non degeneracy case only) - Assignment problems: Solving balanced and unbalanced assignment problems using Hungarian method.
0/2
North West corner Rule
00:00
Assignment Problem
00:00
UNIT 3 -LECTURE NOTES-Queuing Theory
Queuing Theory - definitions of Waiting Line Model - Queue Discipline - traffic intensity -Poisson Arrival - Birth Death Process - Problems from Single Server - Finite and infinite Population Model.
0/3
Queuing Theory
Queuing Problems
Find: Utilization Average number in system Average waiting time in system
UNIT 4- LECTURE NOTES -CPM and PERT
CPM - Principles - Construction of Network for projects - Types of Floats PERT - Time scale analysis - critical path - probability of completion of project.
0/5
Critical path Method
00:00
Critical Path Problems
Floats and its types
Construct the Network
Programme Evaluation Technique
00:00
UNIT 5 -LECTURE NOTES-Simulation
Simulation: Examples, advantages- limitations - Monte - Carlo simulation - Generation of random numbers - steps in simulation - uses of simulation - Simulation applied to queuing problems - simulation applied to some other types of problems
0/2
Simulation Introduction
Simulation problems
Syllabus
21UCL302: RESOURCE MANAGEMENT TECHNIQUES Objectives: The students can enhance knowledge in the following areas such as LPP, transportation problems, assignment problems, Game theory, Queueing models, etc. Prerequisites: Business Mathematics in Higher Secondary level Unit I: Linear Programming Problem Linear Programming - Formulation - Graphical method and Simplex Method - Formation of Primal and Dual. Unit II: Transportation Problems and Assignment Problems Transportation Problems: NWC - LCM - VAM - Starting Solution - MODI method - Optimal solution ᎓ balanced and unbalanced Transportation problems (non degeneracy case only) - Assignment problems: Solving balanced and unbalanced assignment problems using Hungarian method. Unit III: Queuing Theory Queuing Theory - definitions of Waiting Line Model - Queue Discipline - traffic intensity -Poisson Arrival - Birth Death Process - Problems from Single Server - Finite and infinite Population Model. Unit IV: CPM and PERT CPM - Principles - Construction of Network for projects - Types of Floats PERT - Time scale analysis - critical path - probability of completion of project. Unit V: Simulation Simulation: Examples, advantages- limitations - Monte - Carlo simulation - Generation of random numbers - steps in simulation - uses of simulation - Simulation applied to queuing problems - simulation applied to some other types of problems. Text Book: ᎜Recourse Management Techniques᎝ by Prof.V.Sundaresan, K.S.Ganapathy Subramanian and K.Ganesan, .A.R. Publications, March 2011. Unit I: Chapter 2: Sections: 2.1, 2.3, 2.5, 2.6. Chapter3: Sections: 3.1.3, 3.1.4. Unit II: Chapter 7: Sections: 7.1 ᎓ 7.4, Chapter 8: Sections: 8.1 ᎓ 8.6. Unit III: Chapter13: Sections: 13.1 to 13.3, 13.5, 13.6 and 13.8. Unit IV: Chapter 15: Sections: 15.1 to 15.7. Unit IV: Chapter 17: Sections: 17.1 to 17.7. Reference Books Operations Research by Kanti Swarup, Gupta R.K, Manmohan, S .Chand & Sons Education Publications, New Delhi, 16th Edition. 2012, Reprint 2013. Tracts in Operations Research by Kanti Swarup, P.K. Gupta, Manmohan, S. Chand & Sons Education Publications, New Delhi, 11th Edition. 2003, Reprint 2003. Outcomes: Students can gain knowledge in Linear Programming Problem, transportation problem, assignment problem, Game theory, and queuing models. Industry, banks, IT Field, Marketing, Quality control.
0/1
SYLLABUS
QUESTION BANK
0/1
Question bank
ASSIGNMENT
0/1
ASSIGNMENT
PUZZLE
0/1
PUZZLE
NPTEL LINKS
0/1
NPTEL LINKS
RESOURCE LINKS
0/1
RESOURCE LINKS
21UCL302: RESOURCE MANAGEMENT TECHNIQUES

The North-West Corner Rule (NWCR) is a simple method used in Transportation Problems (a type of linear programming) to find an initial feasible solution.

It does not guarantee the optimal solution, but it provides a starting point for further optimization methods like MODI or Stepping Stone.

쮽킹 When to Use

  • When supply and demand are given
  • To quickly allocate shipments from sources to destinations

쮽킹 Steps of North-West Corner Rule

  1. Start at the top-left corner (North-West cell) of the cost table.

  2. Allocate as much as possible:

    Allocation=minᏡ(Supply,Demand)\text{Allocation} = \min(\text{Supply}, \text{Demand})

  3. Adjust supply and demand:
    • Subtract allocated value
    • If supply = 0 ᔒ move down
    • If demand = 0 ᔒ move right
  4. Repeat until all supply and demand are satisfied.NWC PPT
Exercise Files
NWC PPT.pptx
Size: 3.95 MB
Previous
Next

Report

Harassment or bullying behavior
Contains mature or sensitive content
Contains misleading or false information
Contains abusive or derogatory content
Contains spam, fake content or potential malware

Block Member?

Please confirm you want to block this member.

You will no longer be able to:

  • See blocked member's posts
  • Mention this member in posts
  • Invite this member to groups
  • Message this member
  • Add this member as a connection

Please note: This action will also remove this member from your connections and send a report to the site admin. Please allow a few minutes for this process to complete.

Report

You have already reported this .