The simplest and most scalable type of optimization problem is one in which the objective function and constraints are formulated using the simplest type of functions – linear functions. We refer to this class of problems as linear optimization (LO) problems.
Review the options below to login to check your access.
Log in with your Cambridge Aspire website account to check access.
If you believe you should have access to this content, please contact your institutional librarian or consult our FAQ page for further information about accessing our content.