Linear Programs (LPs)
Linear Programming (LP) problems are a very common type of optimization problems. In this type of problem all constraints and the objective function are linear expressions of the decision variables. Each decision variable is restricted to some continuous interval (typically non–negative). Although the methods for solving these types of problems are well known (e.g., the simplex method), only a few efficient implementations of these methods (and additional specialized methods for particular classes of LPs) exists, and these are often crucial for solving the increasingly large instances of LPs arising in industry.
© 2001-2020 Fair Isaac Corporation. All rights reserved. This documentation is the property of Fair Isaac Corporation (“FICO”). Receipt or possession of this documentation does not convey rights to disclose, reproduce, make derivative works, use, or allow others to use it except solely for internal evaluation purposes to determine whether to purchase a license to the software described in this documentation, or as otherwise set forth in a written software license agreement between you and FICO (or a FICO affiliate). Use of this documentation and the software described in it must conform strictly to the foregoing permitted uses, and no other use is permitted.