Optimization Techniques Lab (MA39207)

L-T-P: 0-0-3   |   Credits: 2

Syllabus

Code the following in C++

1. Formulation of LPP (Linear Programming Problem)

   • Identification of feasible space through basic solutions
   • Determination of Basic Feasible Solution (BFS)
   • Selection of optimal solution

2. Methodology Development

   • Understanding the Simplex algorithm for solving LPP
   • Varieties of Simplex method and properties:
     • Big M method
     • Understanding Primal-Dual Simplex algorithm
     • Dual Simplex method
     • Revised Simplex method
     • Sensitivity analysis

3. Integer Programming

   • Gomory cutting plane method
   • Branch and Bound algorithm
   • Application Problems
     • Transportation problem
     • Assignment problems
     • Theory of Games

How to Use this Repository

1. Clone this repository:

   git clone https://github.com/Samya-S/Optimization-Techniques-Lab.git

2. Navigate to the appropriate lab assignment folder:

   cd foldername

3. Compile and run the C++ programs:

   g++ filename.cpp -o outputfile
   ./outputfile

License

This project is licensed under the MIT License - see the LICENSE file for details.