查询词典 integer programming

For the infeasibility or unsolvability of the "Mixed Integer Programming" formulations, this study develops a heuristic algorithm to solve "Mater Planning" problem with fixed setup cost and time.

基於整数规划的不可行性，本研究提出一启发式演算法以解决主规划排程的问题，除了满足多最终产品的产品结构、复杂的供应链网路架构和多张订单需求、多期与共用料的环境，并加入整备成本与时间的考量规划整体供应链的生产与配送计画。

Methods: The algorithm is based on mixed integer linear programming in which binary and positive float variables are employed to represent beam orientation candidates and beamlet weights in beam intensity maps respectively.

本算法基于混合整数线性规划模型，使用二进制变量代表候选的射野方向，非负连续变量代表射野强度图中每个单元野的权重，采用一种确定性搜索策略同时优化射野方向和强度分布。

This research which extends the new product supply chain model of Bulter et al. considers issues on global logistics from a more integrated view. First of all, it solves the global logistic settings problem in new product development by means of mixed-integer linear programming. Secondly, it uses the scenario-based robust optimization to lower the risk in the supply chain design. Then it adds the reliability calculation to make up for the gap between the plan and the real operation. At last it calculates and analyzes the quantitative model on the basis of the case data.

本研究延伸Butler等人之新产品供应链模式，考量更完整之全球运筹相关议题，透过混合整数线性规划描述新产品发展时全球运筹配置问题，并利用情境为基础的稳健最佳化以取得低风险的供应链配置，此外加入可靠度的影响，以弥补供应链规划与实际操作的差距，并加入缺货之惩罚成本，最后以范例资料进行计算与分析此数量模式，经由模式计算结果发现本研究规划之结果，相较於原Butler等人之模式有较低的缺货的发生可能性，且所求得之配置整体可靠度皆有所提升。

By introduction of two key indexes for risk evaluation,i.e.the activity criticality index and cruciality index and adoption of 0??1 integer programming algorithm,a resource reallocation model and a calculating method were established for time-resources tradeoffs of PERT resource-constrained scheduling.An application program according to the function of tradeoff algorithm was complied by use of Delphi 7.0 and Lindo software.

针对资源限制下PERT施工进度计划的工期资源优化问题，引进评价风险量的关键指标———活动关键度指标和重要度指标，采用0-1整数规划技术，建立资源配置优化模型以及优化计算方法；运用Delphi7.0和Lindo工具，开发了该方法的应用程序，并结合实例进行了应用。

The determination of parameters σ and p is converted into the definition of an inequal upper boundary from solving integer programming problem, which decreases the calculation of solving parameters so that the application of CF-PCG algorithm in pactice is more convenient.

分析了CF－PCG算法的效率随其参数的变化性质，将参数σ，p的确定，由求解整数规划子问题转化为确定一个不等的上界，从而减少求解参数的计算量，使CF－PCG算法的实现更加方便。

The topics covered in this course include: unconstrained optimization methods, constrained optimization methods, convex analysis, Lagrangian relaxation, nondifferentiable optimization, and applications in integer programming.

这门课程的主题包括：无约束最优化方法，约束最优化方法，凸分析，拉格朗日松弛法，不可微函数最优化，以及在整数规划上的应用。

The topics covered in this course include: unconstrained optimization methods, constrained optimization methods, convex analysis, Lagrangian relaxation, nondifferentiable optimization, and applications in integer programming.

这门课程的主题包括：无限制最适化方法，限制最适化方法，凸分析，拉格朗日松弛法，不可微分函数最适化，以及在整数规划上的应用。

The result pointed out that the vertical distribution of foliage for each species was different,however,generally speaking,the foliage in upper crown (0.3CL) for broad-leaved species in natural secondary forest took a small percentage,about 10%;in middle or middle lower of the crown(0.4CL to 0.8CL) the branches here took the majority percentage of whole foliage,almost 60%to 75%;but in lower crown(0.8CL),there was about 10%of whole foliage.(5)The interspecies competition of trees in secondary forest was expressed by Hegyi competitioin index,and the active competitor was calculated by the competition zone radius and the tree position,DBH,and distance in the zone,it was not all competitors in tranditional calculation.The study introduced crown area overlap index to describe the crown competition between subject tree and its competitors,furthermore,the crown area was classified into 5 levels with a method of equal crown projection area,therefor,the resulting crown area overlap index showed more realities of existing stand conditons.(6)Based on the theoretics of multiply divide,the spatial strcture optimizing model of secondary forest stand selective thinning was developed by diversity mingling,aggregation index,competition index and crown area overlap index,also designed 10 constraint conditions which were related to forestry meanings,the objective function was solved by the implicit enumeration method with LINGO 9.0,using 0-1 integer programming.

并且得出，每个树种在树冠内相对高度上的叶量的垂直分布是不同的，天然次生林阔叶树种的叶量在树冠的上部(0.3CL以下)所占比例很小，约占10%左右；在树冠的中部以及中下部(0.4CL～0.8CL)，叶量所占比例最大，几乎集中了整个树冠60%～75%的叶量；而在树冠的下部(0.8CL以下)，几乎占很少的叶量，大约10%左右。5、采用Hegyi竞争指数来表现次生林内林木的竞争关系，并且根据竞争圈的大小和林木在竞争圈内的分布位置、大小与距离来计算有效的竞争木，并不是传统意义上的全部竞争木；本研究提出用树冠叠加指数来表示林木与周围树木的树冠竞争情况，并采用等树冠投影面积法把树冠分为5级，这样计算的树冠叠加指数更加与现实林分相符。6、本研究基于乘除法的思想，用多样性混交度、聚集指数、竞争指数和树冠叠加指数构建了天然次生林择伐空间优化模型，设计了10个与林学意义相一致的约束条件，并采用0-1整数规划的思路，在LINGO9.0软件中使用了隐枚举法对目标函数求得最优解。7、以M702标准地为应用实例，具体计算出了每株采伐木，经过择伐后，目标函数值按模型设计的要求发生了极大的改变，增加了5倍多，说明了最后这个解的优良性，满足了设计的要求。

Introduce minimize warp method and GAMS software. A new method is proposed to solve mixed integer programming through combining minimize warp and GAMS.

在总结了目前混合整数规划的求解方法的基础上，引入了最小偏差法和GAMS工具，提出了一种将两者结合起来求解多目标混合整数规划的方法。

A model is initially developed based on the in the integer programming, whose objective function is subject to the minimization of the total re-shuffle containers. To reduce the total number of reshuffles for retrieving the containers, a hybrid algorithm, which combines heuristic rule and distributed genetic algorithm, is employed to solve the model. The heuristic rule is to reduce the range of feasible solution and distributed genetic algorithm is to solve the optimization.

该策略以压箱数最少为目标，建立基于整数规划的选位模型；根据发箱时较低翻箱率的要求，采用启发式算法和分布式遗传算法相结合的混合算法求解选位模型；其中启发式规则用于缩小可行解的范围，分布式遗传算法用于求近似最优解。

But this is impossible, as long as it is engaging in a market economy, there are risks in any operation.

但是，这是不可能的，只要是搞市场经济，是有风险的任何行动。

We're on the same wavelength.

我们是同道中人。