Advertisement:

# Operation Research: Handwritten Notes

Name | Operation Research Handwritten Notes |
---|---|

Author | Unknown |

Pages | 284 pages |

Format | |

Size | 11.3 MB |

### KEYWORDS & SUMMARY:

- Operation research 1
- Mathematical model 1
- Objective function 2
- Decision variables 2
- Solution space 2
- Optimum solution 2
- Standard form 2
- Conversion of maximization to minimization 3
- Linear programming formulation and graphical solution 4
- Simplex method (or the general solution technique) 22
- Algorithm 22
- Optimality condition 23
- Feasibility condition 23
- Degeneracy 23
- Alternative optima 27
- Unbounded solution 30
- Infeasible solution 32
- The simplex method 39
- The simplex algorithm 39
- Artificial starting solution 46
- The M method (M technique method) 46
- Method of penalty 47
- Another simple algorithm of the M-technique 48
- The two- phase method 49
- Differences between M-method and two-phase method 51
- Duality and sensitivity analysis 66
- Relationship between the optimal primal 73
- Solution of primal 75
- Dual simplex method 85
- Feasibility condition (dual feasibility condition) 86
- Economic interpretation of duality 90
- Economic interpretation of dual condition 92
- The transportation problems 97
- Transportation model 97
- Balancing of the transportation model 100
- The transportation algorithm or techniques 102
- Determination of the starting solution 102
- North-west corner method 104
- Least cost method 106
- Vogel approximation method (VAM) 108
- Method of multipliers 116
- Optimality condition 118
- Loop 119
- Transportation model 163
- Simplex explanation of the Hungarian method 164
- Feasibility condition 168
- The transship model 178
- Network models 188
- Network minimization 188
- Minimal spanning tree algorithm 188
- A cyclic network 201
- The shortest-route problem viewed as a transshipment model 214
- Integer linear programming (ILP) 221
- Method of integer programming 221
- The fractional (pure integer) algorithm 221
- Algebraic development of cuts 222
- Main steps (fractional cut method) 225
- The mixed algorithm 234
- Branch and bound method 240
- Main steps (fractional cut method)
- The mixed algorithm 265
- Branch and bound method 271

### Download or view online

Advertisement: