Previous Page
|
Next Page

The Mixed Integer Linear Programming Solver

Overview
Getting Started
Syntax
Functional Summary MILP Solver Options
Details
Branch-and-Bound Algorithm Controlling the Branch-and-Bound Algorithm Presolve and Probing Cutting Planes Primal Heuristics Parallel Processing Node Log Problem Statistics Macro Variable _OROPTMODEL_
Examples
Scheduling Multicommodity Transshipment Problem with Fixed Charges Facility Location Traveling Salesman Problem
References

Syntax: MILP Solver

The following statement is available in the OPTMODEL procedure:

SOLVE WITH MILP </ options>;

Previous Page
|
Next Page
|
Top of Page