PART 1 (Sumisha Miss)
Page:02 Definition of O.R
Page:03 Feature of O R
Page:04 Feature of O R (conti..)
Page:05 UNIT 4 Queuing Theory
Page:06 Queuing system
Page:07 Feature of queuing system( continu....)
Page:08 continu...
Page:09 continu...
Page:10 Queuing Models
Page:11 Single-Server with infinite population
Page:12 Single-server continu...
Page:13 single server problem
Page:14 single server problem
Page:15 single server problem
Page:16 Single server problem
Page:17 Single server problem
Page:18 Single server problem
Page:19 single server problem
Page:20 Single server problem
Page:21 Single server problem
Page:22 Single server problem
Page:23 Single server problem
Page:24 Single-server with finite population
Page:25 Single server with finite continu..
Page:26 finite problem
Page:27 Finite problem
Page:28 Finite problem
Page:29 Finite problem
Page:30 Finite problem
Page:31 Finite problem
Page:32 Finite problem
Page:33 Finite problem
Page:34 Finite problem
Page:35 Finite problem
Page:36 Finite problem
Page:37 Finite problem
Page:38 Finite problem
Page:39 Multi-server with Infinite population
Page:40 Multi server with infinite population continu...
Page:41 Multi server with infinite population continu...
Page:42 Multi server with infinite population problem
Page:43 Multi server with infinite population problem continu...
Page:44 Multi server with infinite population problem continu...
Page:45 Multi server with infinite population problem continu...
Page:46 Multi server with infinite population problem continu...
Page:47 Multi server with infinite population problem continu...
Page:48 Multi server with infinite population problem continu...
Page:49 Multi server with infinite population problem continu...
Page:50 Multi server with infinite population problem continu...
Page:51 Multi server with infinite population problem continu...
Page:52 Multi server with infinite population problem continu...
Page:53 UNIT 5 NETWORK
Page:54 Network-basic components
Page:55 Predecessor Activity
Page:56 Event
Page:57 Rules for network construction
Page:58 rules continu...
Page:59 numbering the events
Page:60 Critical path analysis
Page:61 CPM
Page:62 CPM
Page:63 CPM
Page:64 CPM problem
Page:65 CPM problem
Page:66 CPM problem
Page:67 CPM problem
Page:68 CPM problem
Page:69 CPM problem
Page:70 CPM problem
Page:71 CPM problem
Page:72 CPM problem
Page:73 CPM problem
Page:74 CPM problem
Page:75 CPM problem
Page:76 CPM problem
Page:77 CPM problem
Page:78 CPM problem
Page:79 CPM problem
Page:80 CPM problem
Page:81 CPM problem
Page:82 CPM problem
Page:83 Program Evaluation and Review Technique
Page:84 PERT
Page:85 PERT
Page:86 PERT
Page:87 PERT
PART 2 (Vijitha Miss)
Page:2 Transportation Problem
Page:03 LPP
Page:04 Decision Variables
Page:05 Basic Assumptions of LPP
Page:06 Additivity
Page:07 Genaral formulation of LPP continu.....
Page:08 LPP Problem
Page:09 LPP Problem continu....
Page:10 LPP Problem continu....
Page:11 LPP Problem continu....
Page:12 LPP Problem continu....
Page:13 LPP Problem continu....
Page:14 LPP Problem continu....
Page:15 LPP Problem continu....
Page:16 LPP Problem continu....
Page:17 LPP Problem continu....
Page:18 LPP GRAPHICAL METHOD
Page:19 LPP Graphical Problem
Page:20 LPP Graphical Problem continu....
Page:21 LPP Graphical Problem continu...
Page:22 LPP Graphical Problem continu...
Page:23 LPP Graphical Problem continu...
Page:24 LPP Graphical Problem continu...
Page:25 LPP Graphical Problem continu...
Page:26 LPP Graphical Problem continu...
Page:27 LPP Graphical Problem continu...
Page:28 LPP Graphical Problem continu...
Page:29 LPP Graphical Problem continu...
Page:30 LPP Graphical Problem continu...
Page:31 LPP Graphical Problem continu...
Page:32 LPP Graphical Problem continu...
Page:33 LPP Graphical Problem continu...
Page:34 LPP Graphical method in Infeasible solution
Page:35 Infeasible solution
Page:36 object fn
Page:37 constraints
Page:38 slack variable
Page: 39 standard form of lpp
Page:40 simplex methods steps
Page:41 simplex methods steps
Page:42 simplex methods problems
Page:43 simplex methods problem
Page:44 simplex methods problem
Page:45 simplex methods problem
Page:46 simplex methods problem
Page:47 simplex methods problem
Page:48 simplex methods problem
Page:49 simplex methods problem
Page:50 simplex methods problem
Page:51 Artificial variable technique
Page:52 Artificial variable technique steps
Page:53 Artificial variable technique problem
Page:54 Artificial variable technique problem
Page:55 Artificial variable technique problem
Page:56 Artificial variable technique problem
Page:57 Artificial variable technique problem
Page:58 Artificial variable technique problem
Page:59 penalty problem
Page:60 penalty problem
Page:61 big m method problem
Page:62 big m method problem
Page:63 Duality
Page:64 duality steps
Page:65 definition
Page:66 duality problem
Page:67 dual problem
Page:68 dual problem
Page:69 dual problem
Page:70 dual simplex method
Page:71 dual simplex method problem
Page:72 dual simplex method problem
Page:73 dual simplex method problem
Page:74 dual simplex method problem
Page:75 dual simplex method problem
Page:76 dual simplex method problem
Page:77 dual simplex method problem
Page:78 transportation problem
Page:79 mathematical formulation of tp
Page:80 types of transportation problem
Page:81 basic feasible solution
Page:82 lpp solutions
Page:83 tp using north-west corner method
Page:84 non_degenerate problem
Page:85 non-degenerate problem
Page:86 matrix minimam method
Page:87 least cost method
Page:88 Vogels Approx. Method
Page:89 Vogels problem
Page:90 Vogels problem
Page:91 Vogels problem 12
Page:92 Maximization use in tp 12
Page:93 Maximization problem
Page:94 maximization problem
Page:95 Trans-shipment problem
Page:96 Transportation problem
Page:97 Transportation problem
Page:98 Assignment problem
Page:99 Mathematical formulation of AP
Page:100 Hungarian method
Page:101 Hungarian problem
Page:102 Hungarian problem
Page:103 Hungarian problem
Page:104 Hungarian problem
Page:105 Hungarian probelm
Page:107 Hungarian problem
Page:108 Hungarian problem
Page:109 Unbalanced AP
Page:110 Unbalanced AP problem
Page:111 Maximization case in AP
Page:112 Maximization case in AP problem
Page:113 Maximization problem
Page:114 Maximization problem
Page:115 Travelling Salesman problem
Page:116 Travelling Salesman problem
Page:117 Travelling Salesman problem
Page:118 Travelling Salesman problem
Page:119 Travelling Salesman problem
Page:120 Game theory
Page:121 Payoff
Page:122 Payoff matrix steps
Page:123 Pay off matrix problem
Page:124 Solution to game Game with saddle point-pure strategy
Page:125 Pure strategy problem
Page:126 Pure strategy problem
Page:127 Pure strategy problem
Page:128 Pure strategy problem
Page:129 Pure strategy problem
Page:130 Game without saddle point mixed strategy
Page:131 mixed strategy problem
Page:132 mixed strategy problem
Page:133 Mixed strategy problem
Page:134 Mixed strategy problem
Page:135 Mixed strategy problem
Page:136 Mixed strategy problem
Page:137 Graphical method for n*2 or 2*n game
Page:138 B's pure more - A's expected payoff
Page:139 B's Pure more problem
Page:140 B's pure more problem
Page:141 B's pure more problem
Page:142 B's pure more problem
Page:143 B's pure more problem
Page:144 B's pure more problem
Page:145 B's pure more problem
Page:146 B's pure more problem
Page:147 B's pure more problem
Page:148 Dominance property
Page:149 Dominance property
Page:150 Dominance property problem
Page:151 Dominance property problem
Page:152 Dominance property problem
Page:153 Dominance property problem
Page:154 Dominance property problem
Page:155 Dominance property problem
Page:156 Dominance property problem
Page:157 Pert
Page:158 Pert problem
Page:159 Pert problem
Page:160 Pert problem
Page:161 Pert problem
Page:162 Crashing
Page:163 : Crashing
Page:164 Problem
Page:165 Problem
Page:166 Problem
Page:167 Problem
Page:168 Updating
Page:169 Updating continue
Page:170 Problem
Page:171 Problem
0 comments:
Post a Comment