LINEAR PROGRAMMING - NCERT
Optimisation Problem A problem which seeks to maximise or minimise afunction is called an optimisation problem. An optimisation problem mayinvolve maximisation of profit, production etc or minimisation of cost, from availableresources Linnear PROGRAMMING Problem (LPP)A LINEAR PROGRAMMING problem deals with the optimisation (maximisation/minimisation) of alinear function of two variables (sayx andy) known asobjectivefunctionsubject to the conditions that the variables are non-negative and satisfy a setof LINEAR inequalities (calledlinear constraints). A LINEAR PROGRAMMING problem is aspecial type of optimisation Function LINEAR function Z =ax+by, wherea and b are constants,which has to be maximised or minimised is called a LINEAR objective VariablesIn the objective function Z =ax +by,x andy are calleddecision The LINEAR inequalities or restrictions on the variables of an LPPare calledconstraints.
Chapter 12 LINEAR PROGRAMMING. 242 MATHEMATICS 12.1.10 Theorem 1 Let R be the feasible region (convex polygon) for an LPP and let Z = ax + by be the objective function. When Z has an optimal value (maximum or minimum), where x and y are subject to constraints described by linear inequalities,
Download LINEAR PROGRAMMING - NCERT
Information
Domain:
Source:
Link to this page:
Please notify us if you found a problem with this document: