Linear and integer programming in a hybrid optimization environment
Linear and integer programming are fundamental optimization technologies in Comet™, and are orthogonal in strength to constraint programming and constraint based local search. Comet™ supports high level modeling and search abstractions for these technologies. Their integration into the Comet™ system enables the development of complex hybrid optimization solutions.
Key Linear Programming and Integer Programming Capabilities
- Modeling abstractions for linear and integer programs
- Ability to specify search procedures using high-level nondeterministic constructs
- Support for column generation and sensitivity analysis
