搜索资源列表
gurobi562
- Gurobi Mex is a free MATLAB interface for Gurobi 2, 3, and 4 written by Wotao Yin with contributions by Jon Dattorro, Imre Polik, and Tomáš Strnad. It calls Gurobi to solve linear/quadratic/mixed-integer optimization problems.-Gurobi Mex is a fre
case24
- 基于混合整数规划法的24节点26机系统的机组组合和最优出力问题-Based on a combination of 24 unit mixed-integer programming node 26 machine system problems and optimal output
CVX
- CVX是构建和解决纪律凸程序（应课税品许可证）建模系统。 CVX支持 一些标准的问题类型，包括线性和二次规划（LPS/ QP的），第二阶 锥程序（SOCPs）和半定规划（SDP的）。 CVX也可以解决复杂得多 凸优化问题，包括许多涉及不可微的功能，如`1规范。您 可以使用CVX方便地提出和解决约束范数最小化，熵最大化， 行列式最大化等诸多凸程序。随着2.0版本，CVX也解决了混合 整纪律凸程序（MIDCPs）为好，用适当的整数解算能力。-CVX is a mo
Bilevel-approach-for-optimal
- 在最佳位置和合同双层办法 分布式发电的径向分布定价 使用混合整数线性规划系统-Bilevel approach for optimal location and contract pricing of distributed generation in radial distribution systems using mixed-integer linear programming
DIRECT.tar
- 我们考虑的问题最小化一个连续可微的函数的几个变量服从 简单数据绑定约束限制的一些变量的整数值。我们假设 目标函数的一阶衍生品可以显式计算和近似。 这类混合整数非线性优化问题出现在许多工业和频繁 科学应用,这促使derivative-free方法的研究越来越感兴趣 他们的解决方案。连续变量是由linesearch策略而解决 离散的我们雇佣当地的一个类型的搜索方法。我们提出了不同的算法 以当前迭代的方式更新和满意的平稳性条件 序列的极限点。-We consider the probl
IP
- This function solves the mixed integer linear programming problems. It uses the linprog.m function that comes with the optimization toolbox of MATLAB. It employs the branch and bound algorithm. It uses depth first search.
lp_solve_5.1_MATLAB_exe
- 运用分枝定界法求解混合整数规划的matlab程序- Use the branch and bound method for solving mixed integer programming procedures -Use the branch and bound method for solving mixed integer programming procedures
minlp
- Solves the mixed integer nonlinear problem:
LR
- 实现一个关于表达式的LR语法分析程序，识别用户输入的包含变量与整数的混合算术表达式-Implement an LR parser about expressions, identify the user entered contains variables and mixed integer arithmetic expressions
BNB20
- mixed integer programming
apm
- 混合整数，非线性规划，使用matlab+AMP。内容比较全，效果也不错。-Mixed-integer, nonlinear programming, using matlab+ AMP. Compare the contents of the whole, with good results.
ga
- The genetic algorithm is a method for solving both constrained and unconstrained optimization problems that is based on natural selection, the process that drives biological evolution. The genetic algorithm repeatedly modifies a population of individ
sa
- This paper considers the problem of hybrid flow shops with sublots and sequence dependent setup times to minimize the total tardiness. A mixed integer linear programming model is presented for the problem. The paper also proposes an imperialist compe
Midacomo
- MIDACO是一般的优化问题求解器。 MIDACO可应用于连续（NLP），离散/整数（IP）和混合整数（MINLP）的问题。问题可能被限制在平等和/或不等式约束。 MIDACO适合多达数百至几千优化变量的问题。 MIDACO实现了一个自由衍生物，启发式算法的处理方法处理的问题，因为黑盒可含有关键功能特性，如非凸性，不连续或随机噪声。-MIDACO is a solver for general optimization problems. MIDACO can be applied to con
MXINP
- program of mixed integer optimaization
BendersDecomposition
- BENDERS分解算法，用来求解MIPS，即混合整数线性规划问题。我已经做了注释。-Benders decomposition of solving MIPS problem, which is mixed integer linear programming, I have done Notes
scop
- 用于配电网的重构的混合整数二阶锥规划，利用yamilp工具箱，同时利用了cplex/mosek等求解器求解，配电网示例网架结构较简单。(The mixed integer two order cone programming is used in the distribution network reconfiguration, and the yamilp toolbox is used. At the same time, the cplex/mosek solver is used to
pro_matlab_bb.m
- 分支定界法（branch and bound）是一种求解整数规划问题的最常用算法。这种方法不但可以求解纯整数规划，还可以求解混合整数规划问题。分支定界法是一种搜索与迭代的方法，选择不同的分支变量和子问题进行分支。(Branch and bound (branch and bound) is one of the most commonly used algorithms for integer programming problems. This method can not only solv
lp_solve_5.5.2.0_MATLAB_exe_win64
- 它是一个混合整数线性规划求解器，可以求解纯线性、（混合）整数/二值、半连续和特殊有序集模型。并且经过实际验证，有极高的求解效率。(It is a mixed integer linear programming solver, which can solve pure linear, mixed (integer) / integer, two valued, semi continuous and special ordered set models. And through practica
PuLP-1.6.8
- pulp，用于线性规划和混合整型规划的Python包，非常好用，与普通的建模软件lingo一样简便易用，功能强大(Pulp, for linear programming and mixed integer programming Python package, very easy to use, and ordinary lingo modeling software is easy to use, powerful)