衰老
发表于 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.
Ligament
发表于 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
VEN
发表于 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
Adj异类的
发表于 2025-3-27 12:21:31
http://reply.papertrans.cn/71/7022/702121/702121_34.png
笨拙处理
发表于 2025-3-27 14:37:37
http://reply.papertrans.cn/71/7022/702121/702121_35.png
ONYM
发表于 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.
母猪
发表于 2025-3-28 01:03:14
http://reply.papertrans.cn/71/7022/702121/702121_37.png
CAJ
发表于 2025-3-28 03:41:49
http://reply.papertrans.cn/71/7022/702121/702121_38.png
CHART
发表于 2025-3-28 08:01:01
http://reply.papertrans.cn/71/7022/702121/702121_39.png
BRAWL
发表于 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