Linear programming

Donald A. R. George

Chapter 4 in Mathematical Modelling for Economists, 1988, pp 49-62 from Palgrave Macmillan

Abstract: Abstract In this chapter we turn to a special case of the constrained optimisation problem discussed in Chapter 3. It is the case in which the objective and constraint functions are all linear. Such problems are called linear programmes and are probably the commonest kind of model in practical applications of economics. The linear nature of these problems admits the use of matrix notation which will be familiar from school mathematics (any reader requiring a reminder on elementary matrix ideas should consult Chiang, 1984).

Keywords: Feasible Region; Dual Variable; Shadow Price; Shadow Prex; Primal Constraint (search for similar items in EconPapers)
Date: 1988
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:pal:palchp:978-1-349-19238-0_4

Ordering information: This item can be ordered from
http://www.palgrave.com/9781349192380

DOI: 10.1007/978-1-349-19238-0_4

Access Statistics for this chapter

More chapters in Palgrave Macmillan Books from Palgrave Macmillan
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().