OPL examples that use CPLEX (Mathematical Programming)

These examples illustrate specific features of the OPL modeling language and scripting language for models that use IBM ILOG CPLEX.

Where to find the CPLEX examples
Describes where to find the examples illustrating the use of OPL as a modeling and scripting language in the CPLEX Studio distribution.
Blending problems
Describes examples in the CPLEX Studio distribution that involve blending several resources or materials to create other products corresponding to a demand.
Commodity flow problems
Provides examples that involve transporting one or more commodities through a network of facilities.
Covering problems
Describes examples that involve allocating a number of resources or materials to cover a problem space.
Cutting stock problems
Describes examples that involve cutting larger-sized objects such as sheets, rolls, or boards, into smaller ones to meet a demand.
Fixed-charge production problems
Provides examples of production problems in which the production is an integer value and the factories need to rent or acquire tools to produce the products.
Inventory problems
Describes examples of production problems with an inventory component expressed by a piecewise linear program.
Knapsack problems
Describes examples that involve a container (the ‘knapsack’) with a fixed capacity and a number of items as contents.
Miscellaneous examples
Provides miscellaneous examples that show a specific feature of OPL, but do not necessarily represent realistic optimization problems.
Product mix problems
Describes examples that involve the application of mixed integer-linear programming (MILP) to maximize profits given an available set of resources.
Production problems
Provides examples of the use of mixed integer-linear programming (MILP) to solve production problems.
Profiling
Describes a reduced and scalable version of the examples described in A set of transportation examples.
Quadratic problems
Quadratic programming (QP) models can contain quadratic objectives and quadratic constraints, with continuous and discrete decision variables.
Relaxation of infeasible models
Provides an example of a realistic nurse scheduling problem that includes constraints on compatibilities, vacations, required assignments.
Warehouse location problems
Describes examples that involve warehouse location and planning, a typical discrete optimization problem; that is, an application of integer programming.

Parent topic: Language and Interfaces Examples