| Sl.No | Chapter Name | English |
|---|---|---|
| 1 | Product Mix problem and Notations | Download Verified |
| 2 | Manpower and Production planning formulations | Download Verified |
| 3 | Media selection problem and Bicycle problem | Download Verified |
| 4 | Caterer problem | Download Verified |
| 5 | Maximum flow and bin packing problems | Download Verified |
| 6 | Graphical method (maximization) | Download Verified |
| 7 | Graphical method (minimization) | Download Verified |
| 8 | Algebraic method (maximization) | Download Verified |
| 9 | Algebraic method (minimization) | Download Verified |
| 10 | Comparing graphical and algebraic methods | Download Verified |
| 11 | Algebraic form of simplex algorithm | Download Verified |
| 12 | Tabular form of simplex (maximization) | Download Verified |
| 13 | Tabular form (minimization) | Download Verified |
| 14 | Unboundedness | Download Verified |
| 15 | Infeasibility | Download Verified |
| 16 | Motivation to the dual | Download Verified |
| 17 | Writing the dual for a general LP | Download Verified |
| 18 | Writing dual for a general LP (continued) | Download Verified |
| 19 | Duality theorems | Download Verified |
| 20 | Complimentary slackness theorem | Download Verified |
| 21 | Dual solution using complimentary slackness | Download Verified |
| 22 | Dual solution from simplex table; economic interpretation of dual | Download Verified |
| 23 | Economic Interpretation of the dual; Dual Simplex algorithm | Download Verified |
| 24 | Solving LPs with mixed type of constraints | Download Verified |
| 25 | Matrix method for LP problems | Download Verified |
| 26 | Introducing the transportation problem | Download Verified |
| 27 | North West corner Rule and minimum cost method | Download Verified |
| 28 | Penalty cost method | Download Verified |
| 29 | Stepping stone method and Modified Distribution method | Download Verified |
| 30 | MODI method; Dual of the transportation problem and the optimality of the MODI method | Download Verified |
| 31 | Introducing the Assignment problem | Download Verified |
| 32 | Solving the Assignment problem | Download Verified |
| 33 | Hungarian algorithm; Alternate optimum | Download Verified |
| 34 | Unequal number of rows and columns; Dual of the assignment problem | Download Verified |
| 35 | Optimality of the Hungarian algorithm | Download Verified |
| 36 | Setting up the problem and solving simple LP problems | Download Verified |
| 37 | Unboundedness and infeasibility | Download Verified |
| 38 | Solving other formulations | Download Verified |
| 39 | Solving a transportation problem | Download Verified |
| 40 | Solving an assignment problem | Download Verified |
| Sl.No | Chapter Name | Hindi |
|---|---|---|
| 1 | Product Mix problem and Notations | Download |
| 2 | Manpower and Production planning formulations | Download |
| 3 | Media selection problem and Bicycle problem | Download |
| 4 | Caterer problem | Download |
| 5 | Maximum flow and bin packing problems | Download |
| 6 | Graphical method (maximization) | Download |
| 7 | Graphical method (minimization) | Download |
| 8 | Algebraic method (maximization) | Download |
| 9 | Algebraic method (minimization) | Download |
| 10 | Comparing graphical and algebraic methods | Download |
| 11 | Algebraic form of simplex algorithm | Download |
| 12 | Tabular form of simplex (maximization) | Download |
| 13 | Tabular form (minimization) | Download |
| 14 | Unboundedness | Download |
| 15 | Infeasibility | Download |
| 16 | Motivation to the dual | Download |
| 17 | Writing the dual for a general LP | Download |
| 18 | Writing dual for a general LP (continued) | Download |
| 19 | Duality theorems | Download |
| 20 | Complimentary slackness theorem | Download |
| 21 | Dual solution using complimentary slackness | Download |
| 22 | Dual solution from simplex table; economic interpretation of dual | Download |
| 23 | Economic Interpretation of the dual; Dual Simplex algorithm | Download |
| 24 | Solving LPs with mixed type of constraints | Download |
| 25 | Matrix method for LP problems | Download |
| 26 | Introducing the transportation problem | Download |
| 27 | North West corner Rule and minimum cost method | Download |
| 28 | Penalty cost method | Download |
| 29 | Stepping stone method and Modified Distribution method | Download |
| 30 | MODI method; Dual of the transportation problem and the optimality of the MODI method | Download |
| 31 | Introducing the Assignment problem | Download |
| 32 | Solving the Assignment problem | Download |
| 33 | Hungarian algorithm; Alternate optimum | Download |
| 34 | Unequal number of rows and columns; Dual of the assignment problem | Download |
| 35 | Optimality of the Hungarian algorithm | Download |
| 36 | Setting up the problem and solving simple LP problems | Download |
| 37 | Unboundedness and infeasibility | Download |
| 38 | Solving other formulations | Download |
| 39 | Solving a transportation problem | Download |
| 40 | Solving an assignment problem | Download |
| Sl.No | Chapter Name | Tamil |
|---|---|---|
| 1 | Product Mix problem and Notations | Download |
| 2 | Manpower and Production planning formulations | Download |
| 3 | Media selection problem and Bicycle problem | Download |
| 4 | Caterer problem | Download |
| 5 | Maximum flow and bin packing problems | Download |
| 6 | Graphical method (maximization) | Download |
| 7 | Graphical method (minimization) | Download |
| 8 | Algebraic method (maximization) | Download |
| 9 | Algebraic method (minimization) | Download |
| 10 | Comparing graphical and algebraic methods | Download |
| 11 | Algebraic form of simplex algorithm | Download |
| 12 | Tabular form of simplex (maximization) | Download |
| 13 | Tabular form (minimization) | Download |
| 14 | Unboundedness | Download |
| 15 | Infeasibility | Download |
| 16 | Motivation to the dual | Download |
| 17 | Writing the dual for a general LP | Download |
| 18 | Writing dual for a general LP (continued) | Download |
| 19 | Duality theorems | Download |
| 20 | Complimentary slackness theorem | Download |
| 21 | Dual solution using complimentary slackness | Download |
| 22 | Dual solution from simplex table; economic interpretation of dual | Download |
| 23 | Economic Interpretation of the dual; Dual Simplex algorithm | Download |
| 24 | Solving LPs with mixed type of constraints | Download |
| 25 | Matrix method for LP problems | Download |
| 26 | Introducing the transportation problem | Download |
| 27 | North West corner Rule and minimum cost method | Download |
| 28 | Penalty cost method | Download |
| 29 | Stepping stone method and Modified Distribution method | Download |
| 30 | MODI method; Dual of the transportation problem and the optimality of the MODI method | Download |
| 31 | Introducing the Assignment problem | Download |
| 32 | Solving the Assignment problem | Download |
| 33 | Hungarian algorithm; Alternate optimum | Download |
| 34 | Unequal number of rows and columns; Dual of the assignment problem | Download |
| 35 | Optimality of the Hungarian algorithm | Download |
| 36 | Setting up the problem and solving simple LP problems | Download |
| 37 | Unboundedness and infeasibility | Download |
| 38 | Solving other formulations | Download |
| 39 | Solving a transportation problem | Download |
| 40 | Solving an assignment problem | Download |
| Sl.No | Chapter Name | Telugu |
|---|---|---|
| 1 | Product Mix problem and Notations | Download |
| 2 | Manpower and Production planning formulations | Download |
| 3 | Media selection problem and Bicycle problem | Download |
| 4 | Caterer problem | Download |
| 5 | Maximum flow and bin packing problems | Download |
| 6 | Graphical method (maximization) | Download |
| 7 | Graphical method (minimization) | Download |
| 8 | Algebraic method (maximization) | Download |
| 9 | Algebraic method (minimization) | Download |
| 10 | Comparing graphical and algebraic methods | Download |
| 11 | Algebraic form of simplex algorithm | Download |
| 12 | Tabular form of simplex (maximization) | Download |
| 13 | Tabular form (minimization) | Download |
| 14 | Unboundedness | Download |
| 15 | Infeasibility | Download |
| 16 | Motivation to the dual | Download |
| 17 | Writing the dual for a general LP | Download |
| 18 | Writing dual for a general LP (continued) | Download |
| 19 | Duality theorems | Download |
| 20 | Complimentary slackness theorem | Download |
| 21 | Dual solution using complimentary slackness | Download |
| 22 | Dual solution from simplex table; economic interpretation of dual | Download |
| 23 | Economic Interpretation of the dual; Dual Simplex algorithm | Download |
| 24 | Solving LPs with mixed type of constraints | Download |
| 25 | Matrix method for LP problems | Download |
| 26 | Introducing the transportation problem | Download |
| 27 | North West corner Rule and minimum cost method | Download |
| 28 | Penalty cost method | Download |
| 29 | Stepping stone method and Modified Distribution method | Download |
| 30 | MODI method; Dual of the transportation problem and the optimality of the MODI method | Download |
| 31 | Introducing the Assignment problem | Download |
| 32 | Solving the Assignment problem | Download |
| 33 | Hungarian algorithm; Alternate optimum | Download |
| 34 | Unequal number of rows and columns; Dual of the assignment problem | Download |
| 35 | Optimality of the Hungarian algorithm | Download |
| 36 | Setting up the problem and solving simple LP problems | Download |
| 37 | Unboundedness and infeasibility | Download |
| 38 | Solving other formulations | Download |
| 39 | Solving a transportation problem | Download |
| 40 | Solving an assignment problem | Download |