Abstract
This chapter discusses the method and the geometric interpretation of the solution of a marginal programming problem. It presents a general theory of programming that deals with specific methods of solving programming problems. The chapter also presents a case where a solution is obtained by the method of differential calculus, also called marginal calculus, because it consists in comparing the marginal increment of the function. It then presents a case when this classical method cannot be applied. From a theoretical point of view, the method of differential calculus is the simplest, but it cannot be used when the derivatives of the objective function and the balance conditions do not have certain specific properties. Differential calculus cannot be used for solving a linear programming problem, that is, when the objective function and the balance conditions are linear functions of the unknowns of the problem. The methods of calculation that are used for solving linear programming problems, although they apply to simple linear functions, are generally much more complicated than the methods of differential calculus.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
