Abstract
A linear mathematical programming problem is a problem of finding a maximum or minimum of a linear functional over a convex polyhedron.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this chapter
Cite this chapter
Luc, D.T. (2016). Linear Programming. In: Multiobjective Linear Programming. Springer, Cham. https://doi.org/10.1007/978-3-319-21091-9_3
Download citation
DOI: https://doi.org/10.1007/978-3-319-21091-9_3
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-21090-2
Online ISBN: 978-3-319-21091-9
eBook Packages: Business and ManagementBusiness and Management (R0)