Passport Status Tracking System - Algorithm Used: Simplex Algorithm
Simplex Algorithm
- Constraints of type (<=) : for each constraint i of this type, we add a slack variable ݁ei, such that ݁ei is nonnegative.
- Constraints of type (>=) : for each constraint ݅i of this type, we add a surplus variable ݁ei, such that ݁ei is nonnegative.
- Set n-m variables equal to zero. These variables are called non-basic variables (N.B.V).
- Solve the system for the m remaining variables. These variables are called basic variables (B.V.)
- The vector of variables obtained is called the basic solution (it contains both basic and non-basic variables).
- Each basic solution of (LP=) for which all variables are nonnegative, is called an admissible basic solution. This admissible basic solution corresponds to an extreme point (corner solution).
- Maximum of the Cj - zjfor maximum problems.
- Minimum of the Cj - zjfor maximum problems.
Simplex Algorithm