Algorithm for Evaluation Changes in Linear Programming Using Kuhn-Tucker Condition

Abstract

In several problems of life confronting man, this study aims at finding out not only an optimal solution but also the fluctuating cost of raw materials, expected sales volumes, labour cost etc. The essence of the analysis is is to establish which constraint is binding or not binding. If the constraint is binding, therefore the variable is different from zero (0) else equate the variable to zero (0) with respect to any primal constraint for which equality seizes to hold at optimal solution, will have the value of the corresponding dual variable zero (0), but any constraint in the primal problem for which equality holds at optimal solution will have its corresponding dual variable different from zero. When changes are made in linear programming model, we sought for an optimal solution using an algorithm to determine the final value of the problem involving Kuhn-Tucker (K-T) conditions for a basic feasible solution which exist, a flowchart of the algorithm is presented in this work to enhance the understanding of the application.