Linear Programming

Mahmut Parlar
Additional contact information
Mahmut Parlar: McMaster University, DeGroote School of Business

Chapter 4 in Interactive Operations Research with Maple, 2000, pp 99-151 from Springer

Abstract: Abstract Linear programming (LP) is a flexible and powerful optimization technique that is used to determine the nonnegative values of n decision variables xj, which satisfy m linear constraints $$\begin{array}{*{20}{c}} {\sum\limits_{j = 1}^n {{a_{ij}}{x_j}\{ \leqslant , = \geqslant \} {b_i},} }&{i = 1,2, \ldots ,m} \end{array}$$ and maximize (or minimize) a linear objective function $$z = \sum\limits_{j = 1}^n {{c_j}{x_j}}$$ where the parameters a ij , b i; and c j are given constants.

Keywords: Decision Variable; Linear Programming Problem; Feasible Region; Basic Variable; Simplex Method (search for similar items in EconPapers)
Date: 2000
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:spr:sprchp:978-1-4612-1356-7_4

Ordering information: This item can be ordered from
http://www.springer.com/9781461213567

DOI: 10.1007/978-1-4612-1356-7_4

Access Statistics for this chapter

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