Transcription of Chapter 10 Linear Programming
{{id}} {{{paragraph}}}
Example: dental hygienist
Chapter 10 Linear Programming
1 APPLIED ECONOMICS By Diewert. July, 2013. Chapter 10: Linear Programming 1. Introduction The theory of Linear Programming provides a good introduction to the study of constrained maximization (and minimization) problems where some or all of the constraints are in the form of inequalities rather than equalities. Many models in economics can be expressed as inequality constrained optimization problems. A Linear program is a special case of this general class of problems where both the objective function and the constraint functions are Linear in the decision variables. Linear Programming problems are important for a number of reasons: Many general constrained optimization problems can be approximated by a Linear program. The mathematical prerequisites for studying Linear Programming are minimal; only a knowledge of matrix algebra is required.
for a linear programming problem is the problem of minimizing a linear function cTx in the vector of nonnegative variables x ≥ 0 N subject to M linear equality constraints, which are written in the form Ax = b. 1 “Linear programming was developed by George B. Dantzig in 1947 as a technique for planning the
Loading..
Tags:
Information
Domain:
Source:
Link to this page:
Please notify us if you found a problem with this document: