搜索资源列表
Simplex
- 线性规划中的单纯形法，单纯形法是求解线性规划的最主要方法，程序首先确定初始可行解，如没有找到，则引入人工变量或松弛变量来求解-Of linear programming simplex method, simplex method for solving linear programming are the most important methods, procedures to determine first of all, the initial feasible solution, su
incircle
- The INCIRCLE code formulates the problem as an LP with slack variables
24782
- Material Requirement Planning is a dependent demand system that calculates materials requirements and production plans to satisfy known and forecast sales orders. It helps to make volume and timing calculations based on an idea of what will be necess
Bellman-Ford-queue-optimization
- Bellman-Ford算法关键之处在于：只有那些在前一遍松弛中改变了最短路程估计值的顶点，才能引起它们邻接点最短路程估计值发生改变。-Bellman-Ford algorithm that crucial point: Only those former slack again changed the vertex shortest distance estimates, causing their neighbors to the shortest distance estimates ch
Least-Slack-Time-Code
- Least Slack Time Code Java code
ccr-as-rows-are-DMU-in-p-model
- 计算数据包络分析中的ccr和bcc模型决策单元的效率值松弛变量的值等-calculate the efficiency and slack of ccr and bcc model in matlab
CVS_Carbon
- 功能是在有潮流约束，碳排放约束，电压和无功约束等条件下的发电权交易模型，采用基于约束松弛变量策略的中心校正内点法求解-There is a trend in the function generation right transaction model under conditions of constraint, carbon constraints, voltage and reactive power constraints, using slack variables to solve
Perceptron
- 本实验的目的是学习和掌握两种感知器算法：批处理感知器算法和批处理裕量松弛 算法。感知器算法是通过学习两类已标记的样本，建立一个线性分类器。学习的过程就是求解感知器权系数的过程，人们通过建立一个准则函数J(a),将求解感知器权系数的问题简化为一个标量函数J(a)的极小化问题，即当a为解向量时，J(a)最小。而极小化问题常用梯度下降法来解决。本实验给出了基于梯度下降法的两种感知器算法，介绍了原理并编程实现，最后对两种算法的特点加以比较分析。-The purpose of this study i