Linear Programming $$\sum c_jx_j, x_j \ \ge 0\ \forall j$$ ∑ c j x j, x j ≥ 0 ∀ j

J. MacGregor Smith ()
Additional contact information
J. MacGregor Smith: University of Massachusetts

Chapter Chapter 3 in Combinatorial, Linear, Integer and Nonlinear Optimization Apps, 2021, pp 83-132 from Springer

Abstract: Overview One of the most fundamental approaches to optimization problems is that of Linear Programming. While it is very general and has wide applicability, a number of important theoretical properties are part of LP which carry over to other optimization problems, viz. development of upper and lower bounds, linear approximations, simplex type approaches, etc.

Date: 2021
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:spochp:978-3-030-75801-1_3

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

DOI: 10.1007/978-3-030-75801-1_3

Access Statistics for this chapter

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