线性编程和混合整数线性编程
用连续和整数变量解决线性编程问题
Before you begin to solve an optimization problem, you must choose the appropriate approach: problem-based or solver-based. For details, seeFirst Choose Problem-Based or Solver-Based Approach。
对于基于问题的方法，创建问题变量，然后代表这些符号变量的目标函数和约束。对于基于问题的步骤，请参阅Problem-Based Optimization Workflow。要解决结果问题，使用solve。
For the solver-based steps to take, including defining the objective function and constraints, and choosing the appropriate solver, seeSolver-Based Optimization Problem Setup。要解决结果问题，使用intlinprogwhen there are integer constraints, or uselinprog.当没有整数约束时。
Functions
Live Editor Tasks
| 优化 | 优化or solve equations in the Live Editor |
Topics
Problem-Based Mixed-Integer Linear Programming
- 混合整数线性编程基础：基于问题
混合整数线性编程的简单示例。 - Factory, Warehouse, Sales Allocation Model: Problem-Based
这example shows how to set up and solve a mixed-integer linear programming problem. - Traveling Salesman Problem: Problem-Based
这example shows how to use binary integer programming to solve the classic traveling salesman problem. - Optimal Dispatch of Power Generators: Problem-Based
这个例子显示了如何最佳地安排两个燃气发电机，这意味着获得最多的收入减去费用。 - Office Assignments by Binary Integer Programming: Problem-Based
这example shows how to solve an assignment problem by binary integer programming using the optimization problem approach. - 混合整数二次编程产品组合优化：基于问题
此示例显示如何使用基于问题的方法来解决混合整数二次编程（MIQP）产品组合优化问题。 - 切割股票问题：基于问题
这example shows how to solve a cutting stock problem using linear programming with an integer linear programming subroutine. - Minimize Makespan in Parallel Processing
最小化一组处理器以完成一组任务的最大时间。 - 通过整数编程解决Sudoku难题：基于问题
此示例显示了如何使用二进制整数编程来解决Sudoku拼图。
基于求解器的混合整数线性编程
- 混合整数线性编程基础：基于求解器
混合整数线性编程的简单示例。 - Factory, Warehouse, Sales Allocation Model: Solver-Based
Example of optimizing logistics in a small supply chain. - Traveling Salesman Problem: Solver-Based
The classic traveling salesman problem, with setup and solution. - Optimal Dispatch of Power Generators: Solver-Based
Example showing how to schedule power generation when there is a cost for activation. - 由二进制整数编程的办公室分配：基于求解器
Solve an assignment problem using binary integer programming. - 混合整数二次编程产品组合优化：求解器
示例显示如何优化投资组合，二次编程问题，具有整数和其他约束。 - Cutting Stock Problem: Solver-Based
Solve a cutting stock problem using linear programming with an integer programming subroutine. - Solve Sudoku Puzzles Via Integer Programming: Solver-Based
Sudoku is a type of puzzle that you can solve using integer linear programming.
基于问题的线性规划
- 建立了一个线性规划,具体问题具体分析
基于问题的方法的线性问题配方。 - Maximize Long-Term Investments Using Linear Programming: Problem-Based
优化a deterministic multiperiod investment problem using linear programming and the problem-based approach. - Create Multiperiod Inventory Model in Problem-Based Framework
Create an inventory model, where stock is carried between time periods, in the problem-based approach.
基于求解的线性规划
- Set Up a Linear Program, Solver-Based
Problem formulation using the solver-based approach. - 典型的线性规划问题
这example shows the solution of a typical linear programming problem. - Maximize Long-Term Investments Using Linear Programming: Solver-Based
优化a deterministic multiperiod investment problem using linear programming.
模型分析线性和整数问题
- 整数和逻辑建模
Techniques for modeling with integer constraints using "Big-M" and other techniques. - Investigate Linear Infeasibilities
了解哪些线性约束导致问题不可行。
基于问题的算法
- Problem-Based Optimization Algorithms
了解优化功能和对象如何解决优化问题。 - Supported Operations for Optimization Variables and Expressions
探索优化变量和表达式的支金宝app持的数学和索引操作。
Solver-Based Algorithms and Options
- 线性编程算法
最小化线性目标函数n尺寸只有线性和束缚约束。 - Mixed-Integer Linear Programming Algorithms
用于混合整数线性程序的解决方案的算法。 - 优化选项参考
Explore optimization options. - Tuning Integer Linear Programming
改进解决方案或解决方案时间的步骤。金宝搏官方网站 - intlinprog输出函数和绘图函数语法
如何监控进度intlinprogsolution process.
您还可以从以下列表中选择一个网站：