Linear Programming ∑cjxj,xj≥0∀j

0Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

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.

Cite

CITATION STYLE

APA

MacGregor Smith, J. (2021). Linear Programming ∑cjxj,xj≥0∀j. In Springer Optimization and Its Applications (Vol. 175, pp. 83–132). Springer. https://doi.org/10.1007/978-3-030-75801-1_3

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free