Linear Programming and Mixed-Integer Linear Programming
Solve linear programming problems with continuous and integer variables
Approaches to LP/MILP | Characteristics |
---|---|
具体问题具体分析优化 | Easier to create and debug |
Represent the objective and constraints symbolically | |
Solution time is longer because of translation time from problem form to matrix form | |
See the steps inProblem-Based Workflow | |
Basic example:Mixed-Integer Linear Programming Basics: Problem-Basedor the videoSolve a Mixed-Integer Linear Programming Problem using Optimization Modeling | |
Solver-Based Optimization | Harder to create and debug |
Represent the objective and constraints as matrices | |
Can use imported MPS problem | |
Solution time is shorter because there is no translation time to matrix form | |
See the steps inOptimization Problem Setup | |
Basic example:Mixed-Integer Linear Programming Basics: Solver-Based |
- 具体问题具体分析优化
Solve linear programming problems and mixed-integer linear programming problems by creating an optimization problem. - Solver-Based Optimization
Solve linear programming problems and mixed-integer linear programming problems by defining matrices that represent the objective function and constraints.
Featured Examples
Was this topic helpful?