Abstract
Many of the mathematical methods are very useful when applied to problems of optimisation, that is, maximising and minimising quantities. The methods of differential calculus and linear programming are of particular importance. The methods of linear programming are a mathematical approach used in determining a course of action to be used to obtain an objective when the possible courses of action are restricted by certain conditions called constraints. While the types of problems that can be solved by these methods must fit several basic requirements, there is still a large assortment of problems that can be solved by linear programming techniques. This chapter discusses linear programs in two variables. In general, all linear programming problems involve the optimisation, maximisation, or minimisation, of a linear expression called the objective function. It shall be assumed that the objective function may be evaluated at any point in the feasible set even at those points yielding nonintegral solutions.
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
