优化问题

In light of the approximation of Muskingum flood calculation model,an improving model on average flow within prescribed time in flood calculation is presented using curve integral instead of general arithmetic mean.

针对马斯京根洪水演算模型的近似性问题，用曲线积分法改进了原模型中时段流量的简单算术平均值法，并利用连续性空间优化问题的蚁群算法对改进的马斯京根洪水演算模型进行参数最优估计，使演算流量更加接近实际。

The method's disadvantage is that the discrete variables can't be solved in primal-dual interior point method.

但原对偶内点法在求解优化问题时，无法有效解决离散变量的问题。

It transforms the parameter operator identification of inverse problem.

该方法把对于参数算子识别反问题转化为优化问题并用模拟退火算法进行求解。

The knap problem is a classical combinatorial optimization problem which plays an important role in a network source assignment.

背包问题是一类经典的组合优化问题，在网络资源分配中有着广泛的运用。

Through this model, which could make full use of the given prior information as the constraints of maximum likelihood estimation and based on Lagrange function, the calculation problem of fault prior probabilities was transformed to non-constrained optimization problem.

该模型以相关的先验信息作为最大概率估计的约束条件，并通过拉格朗日函数，将故障先验概率估算问题转化成无约束优化问题。

In this paper, we start with a new formulation which is proposed based on the K-SVCR method. We then transform it as a complementarity problem and further a strongly convex unconstrained optimization problem by using the implicit Lagrangian function.

在本文中，我们首先在K-SVCR方法的基础上提出了新的模型，然后把新模型转化成一个互补问题，并利用Lagrangian隐函数进一步转化成一个强凸的无约束优化问题。

Furthermore, the design problem of the suboptimal guaranteed cost controller is turned into a convex optimization problem with linear matrix inequalities constraints.

在此基础上，将次优保性能控制器设计问题转化为一组线性矩阵不等式约束下的凸优化问题。

Based on the proposed performance criterion, a sufficient condition for the existence of gain-scheduled H2/H(subscript ∞) filter is derived. Furthermore, the filter design problem is converted into a convex optimization problem with linear matrix inequality constraints.

基于该性能准则，推导了变增益H2/H滤波器存在的充分条件，并将滤波器设计问题转化为具有线性矩阵不等式约束的凸优化问题。

To reduce the conservatism in the estimation, the Schur complements of the matrixes are applied to transform the problem of selecting a suitable quadratic Lyapunov function into a simple convex optimization problem with linear matrix inequality constraints.

同时为了减少保守性，利用矩阵的Schur补性质，将如何选取该二次型Lyapunov函数的问题转化为标准的LMI凸优化问题。

A mathematical programming model was given for the problem.

本文提出了一个图书仓库的布局优化问题，对该问题建立了数学规划模型。

For a big chunk of credit-card losses; the number of filings (and thus charge-off rates) would be rising again, whether

年美国个人破产法的一个改动使得破产登记急速下降，而后引起了信用卡大规模的亏损。

Eph. 4:23 And that you be renewed in the spirit of your mind

弗四23 而在你们心思的灵里得以更新