Nonlinear Programming for Animal Nutriations: An Introduction for Maximize Milk Gain by Buffalo

Abstract

Introduction: Algebraic procedures such as pivoting are so powerful for manipulating linear equalities and inequalities thatmany nonlinearprogramming algorithms replace the given problem by an approximating linear problem [1][2][3][4] .Separable programming is a prime example, and also one of the most useful, of these procedures. As inseparable programming, these nonlinear algorithms usually solve several linear approximations by letting thesolution of the last approximation suggest a new one [5][6][7][8] . By using different approximation schemes, this strategy can be implemented in several ways. This sectionintroduces three of these methods, all structured to exploit the extraordinary computational capabilities of thesimplex method and the wide-spread availability of its computer implementation.There are two general schemes for approximating nonlinear programs 9-12 .