Einstein International Journal Organization(EIJO)

Abstract

This paper examined an Algorithm for evaluating changes in Linear Programming using Kuhn Tucker condition. 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. There exists, a flowchart of the algorithm as presented in this paper to enhance the understanding of the application.

            [1]. Agbadudu, A.B. (1996). ?Elementary Operations research.? Vol.1, Benin City: Mudiaga Ltd.

[2]. Ekoko, P.O. (1999). ?Basic Operation Research in science and social sciences. Benin City, United City press.

[3]. Ekoko, P.O. (2004). ?An algorithm for evaluating continuous changes in Right ?hand side (R.H.S) values of LP problem”, Journal for die reine Und Angewandte Mathematic, 6, 1189-1194.[4]. Forrester, J.W. (2001). ?An introduction to sensitivity Analysis. MIT System Dynamics in Education project.

[4]. Kuhn, H. & Tucker, A. (1951) “Nonlinear Programming”. In Berkeley Symposium on Mathematical Statistics and Probability, University of California Press, Berkeley and Los Angeles.

[5]. Taha, R.A. (2006). ?An introduction to operational research.? New Delhi prentice Hall of India.