Example: stock market
LINEAR PROGRAMMING - NCERT

LINEAR PROGRAMMING - NCERT

Back to document page

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,

  Programming, Linear programming, Linear, Chapter

Download LINEAR PROGRAMMING - NCERT


Information

Domain:

Source:

Link to this page:

Please notify us if you found a problem with this document:

Other abuse

Advertisement

Related search queries