ILOG CPLEX 10.1 User's Manual > Meet ILOG CPLEX > In This Manual |
In This Manual |
INDEX
![]() |
This manual consists of these parts:
Chapter 1, ILOG Concert Technology for C++ Users, introduces Concert Technology. It provides an overview of the design of the library, explains modeling techniques, and offers an example of programming with Concert Technology. It also provides information about controlling parameters.
Chapter 2, ILOG Concert Technology for Java Users, explores the full range of features that the ILOG CPLEX Java API offers to solve mathematical programming problems. An overview of the architecture is given, then techniques for creating models are explained through examples.
Chapter 3, ILOG Concert Technology for .NET Users, offers an example of this API.
Chapter 4, ILOG CPLEX Callable Library, introduces the ILOG CPLEX Callable Library. It sketches the architecture of the product, explains the relation between the Interactive Optimizer and the Callable Library, and offers an example of programming with the Callable Library. It also provides an overview about the parameters you control in ILOG CPLEX.
Chapter 5, Developing CPLEX Applications, provides tips for developing applications with ILOG CPLEX, suggests ways to debug your applications built around ILOG CPLEX, and provides a checklist to help avoid common programming errors.
Chapter 6, Managing Input and Output, explains how to enter mathematical programs efficiently and how to generate meaningful output from your ILOG CPLEX applications. It also lists the available file formats for entering data into ILOG CPLEX and writing bases and solutions from ILOG CPLEX.
Chapter 7, Licensing an Application, tells you what you must consider when you want to license your ILOG CPLEX application for deployment.
Chapter 8, Solving LPs: Simplex Optimizers, goes deeper into aspects of linear programming with ILOG CPLEX. It explains how to tune performance and how to diagnose infeasibility in a model. It also offers an example showing you how to start optimizing from an advanced basis.
Chapter 9, Solving LPs: Barrier Optimizer, continues the exploration of optimizers for linear programming problems. It tells how to use the primal-dual logarithmic barrier algorithm implemented in the ILOG CPLEX Barrier Optimizer to solve large, sparse linear programming problems.
Chapter 10, Solving Network-Flow Problems, shows how to use the ILOG CPLEX Network Optimizer on linear programming problems based on a network model.
Chapter 11, Solving Problems with a Quadratic Objective (QP), takes up programming problems in which the objective function may be quadratic. It, too, includes examples.
Chapter 12, Solving Problems with Quadratic Constraints (QCP), introduces problems where the constraints are not strictly linear but may also include convex quadratic constraints and shows how to use the barrier optimizer to solve them.
Chapter 13, Solving Mixed Integer Programming Problems (MIP), shows you how to handle MIPs. It particularly emphasizes performance tuning and offers a series of examples.
Chapter 14, Using Special Ordered Sets (SOS), sketches how to declare and use special ordered sets in formulating your model.
Chapter 15, Using Semi-Continuous Variables: a Rates Example, demonstrates how to use semi-continuous variables in a rate-setting problem.
Chapter 16, Using Piecewise Linear Functions in Optimization: a Transport Example, applies piecewise linear functions to model a transportation problem.
Chapter 17, Logical Constraints in Optimization, introduces logical constraints as they are implemented in Concert Technology and in the Callable Library.
Chapter 18, Using Indicator Constraints, explains a technique for expressing relations among constraints in a model by means of binary variables that turn on or off enforcement of a given constraint.
Chapter 19, Using Logical Constraints: Food Manufacture 2, follows up that introduction to logical constraints with an example borrowed from a well known textbook about modeling.
Chapter 20, Early Tardy Scheduling, demonstrates logical constraints, piecewise linear functions in optimization, and aggressive MIP emphasis in a production planning example that includes penalties for earliness and tardiness.
Chapter 21, Using Column Generation: a Cutting Stock Example, shows how to formulate a model by generating columns one by one. It uses a cutting stock example to illustrate the technique.
Chapter 22, Preprocessing and Feasibility introduces you to the effects of preprocessing on feasibility and infeasibility.
Chapter 23, Managing Unboundedness explains what a report of unbounded means, suggests ways to avoid an unbounded outcome, and outlines means to diagnose the cause of unboundedness in your model.
Chapter 24, Diagnosing Infeasibility by Refining Conflicts, describes the conflict refiner, a feature of ILOG CPLEX that helps you identify contradictory constraints and bounds within your model.
Chapter 25, Repairing Infeasibilities with FeasOpt, documents a feature of ILOG CPLEX that may enable you to repair detected infeasibilities in your model.
Chapter 26, User-Cut and Lazy-Constraint Pools, formerly available only through Customer Support, is now part of the standard documentation. It explains in greater detail how to manage your own pools of cuts and lazy constraints.
Chapter 27, Using Goals, shows how to use goals to control a MIP search.
Chapter 28, Using Callbacks shows how to use callbacks to control a MIP search.
Chapter 29, Goals and Callbacks: a Comparison, compares the two different approaches.
Chapter 30, Advanced Presolve Routines, formerly available only through Technical Support, is now part of the standard documentation. It documents advanced aspects of presolve and aggregation more fully.
Chapter 31, Advanced MIP Control Interface, formerly available only through Technical Support, is now part of the standard documentation. It shows you how to exploit advanced features of MIP. It provides important additional information if you are using callbacks in your application.
Chapter 32, Parallel Optimizers, explains how to exploit parallel optimizers in case your hardware supports parallel execution.
The Index completes this manual.
Copyright © 1987-2006 ILOG S.A. All rights reserved. Legal terms. | PREVIOUS NEXT |