Linear and Integer Programming with Sensitivity Analysis Approach

Abstract- Linear programming is the name of a branch of applied mathematics that deals with solving optimization problems of a particular form. Linear programming problems consist of a linear cost function or sometimes also called as objective function which is to be minimized or maximized subject to a certain number of constraints. The constraints are linear inequalities of the variables used in the cost function. Linear programming is closely related to linear algebra.It often uses inequalities in the problem statement rather than equalities This paper is concerned with the advantages and disadvantages of linear and integer programming anh through an example is provided a pivot based solution technique of of linear optimaization. I