找回密碼
 To register

QQ登錄

只需一步,快速開始

掃一掃,訪問微社區(qū)

打印 上一主題 下一主題

Titlebook: Operations Research Proceedings 2011; Selected Papers of t Diethard Klatte,Hans-Jakob Lüthi,Karl Schmedders Conference proceedings 2012 Spr

[復制鏈接]
樓主: 方言
31#
發(fā)表于 2025-3-27 00:01:59 | 只看該作者
On the controlling of liquid metal solidification in foundry practice value problem of the Stefan type. The optimal control problem was solved numerically using the gradient method. The gradient of the cost function was found with the help of the conjugate problem. The discreet conjugate problem was posed with the help of the Fast Automatic Differentiation technique.
32#
發(fā)表于 2025-3-27 02:47:11 | 只看該作者
Optimal dividend and risk control in diffusion models with linear costssociated with this problem is given by the nonlinear form of elliptic type. Using the viscosity solutions technique, we solve the corresponding penalty equation and show the existence of a classical solution to the variational inequality. The optimal policy of dividend payment and risk exposure is s
33#
發(fā)表于 2025-3-27 08:36:53 | 只看該作者
Necessary Optimality Conditions for Improper Infinite-Horizon Control Problemsm principle holds with an explicitly specified adjoint variable if an appropriate relation between the discount rate, the growth rate of the solution and the growth rate of the objective function is satisfied. The main novelty is that the result applies to general non-stationary systems and the opti
34#
發(fā)表于 2025-3-27 12:21:31 | 只看該作者
35#
發(fā)表于 2025-3-27 14:37:37 | 只看該作者
36#
發(fā)表于 2025-3-27 21:04:08 | 只看該作者
The stable set polytope of claw-free graphs with stability number greater than three to generalize his result by considering the Stable Set polytope of claw-free graphs. However this is still an open problem. Here we solve it for the class of claw-free graphs with stability number greater than 3 and without 1-joins.
37#
發(fā)表于 2025-3-28 01:03:14 | 只看該作者
38#
發(fā)表于 2025-3-28 03:41:49 | 只看該作者
39#
發(fā)表于 2025-3-28 08:01:01 | 只看該作者
40#
發(fā)表于 2025-3-28 10:24:45 | 只看該作者
Rounding and Propagation Heuristics for Mixed Integer Programmingt only employ computationally inexpensive procedures such as rounding and logical deductions (propagation). We give an overview of eight different approaches. To assess the impact of these primal heuristics on the ability to find feasible solutions, in particular early during search, we introduce a
 關(guān)于派博傳思  派博傳思旗下網(wǎng)站  友情鏈接
派博傳思介紹 公司地理位置 論文服務流程 影響因子官網(wǎng) 吾愛論文網(wǎng) 大講堂 北京大學 Oxford Uni. Harvard Uni.
發(fā)展歷史沿革 期刊點評 投稿經(jīng)驗總結(jié) SCIENCEGARD IMPACTFACTOR 派博系數(shù) 清華大學 Yale Uni. Stanford Uni.
QQ|Archiver|手機版|小黑屋| 派博傳思國際 ( 京公網(wǎng)安備110108008328) GMT+8, 2025-10-11 06:24
Copyright © 2001-2015 派博傳思   京公網(wǎng)安備110108008328 版權(quán)所有 All rights reserved
快速回復 返回頂部 返回列表
运城市| 恩平市| 黄梅县| 商都县| 鄂托克旗| 六盘水市| 辽阳市| 红安县| 安宁市| 玉溪市| 正定县| 汝州市| 绥宁县| 大荔县| 萨嘎县| 长武县| 托克逊县| 正定县| 佛坪县| 双牌县| 浦城县| 桐庐县| 三都| 宁阳县| 河南省| 塘沽区| 南通市| 琼中| 昌邑市| 和田市| 丹东市| 九龙坡区| 怀宁县| 凯里市| 肇东市| 井研县| 观塘区| 藁城市| 阿拉尔市| 五台县| 万年县|