Numerical Algebra Control and Optimization最新文献_第10页

Dynamics of a stage structure prey-predator model with ratio-dependent functional response and anti-predator behavior of adult prey 具有比例依赖功能反应和成年猎物反捕食行为的阶段结构捕食-捕食模型动力学

IF 1.3

Numerical Algebra Control and Optimization Pub Date : 2021-01-01 DOI: 10.3934/naco.2020033

P. Panja, Soovoojeet Jana, S. Mondal

引用次数: 8

Application of the bernstein polynomials for solving the nonlinear fractional type Volterra integro-differential equation with caputo fractional derivatives bernstein多项式在求解带有caputo分数阶导数的非线性分数型Volterra积分微分方程中的应用

IF 1.3

Numerical Algebra Control and Optimization Pub Date : 2021-01-01 DOI: 10.3934/NACO.2021021

Miloud Moussai

引用次数: 2

Geodesic $ mathcal{E} $-prequasi-invex function and its applications to non-linear programming problems 测地线$ mathcal{E} $-预拟逆函数及其在非线性规划问题中的应用

IF 1.3

Numerical Algebra Control and Optimization Pub Date : 2021-01-01 DOI: 10.3934/naco.2021040

Akhlad Iqbal, P. Kumar

引用次数: 1

Controllability and observability of stochastic implicit systems and stochastic GE-evolution operator 随机隐式系统的可控性、可观测性与随机ge演化算子

IF 1.3

Numerical Algebra Control and Optimization Pub Date : 2021-01-01 DOI: 10.3934/NACO.2021009

Zhao-qiang Ge

引用次数: 4

Optimal control of a dynamical system with intermediate phase constraints and applications in cash management 具有中间阶段约束的动态系统的最优控制及其在现金管理中的应用

IF 1.3

Numerical Algebra Control and Optimization Pub Date : 2021-01-01 DOI: 10.3934/NACO.2021005

Mourad Azi, Mohand Ouamer Bibi

{"title":"Optimal control of a dynamical system with intermediate phase constraints and applications in cash management","authors":"Mourad Azi, Mohand Ouamer Bibi","doi":"10.3934/NACO.2021005","DOIUrl":"https://doi.org/10.3934/NACO.2021005","url":null,"abstract":"The aim of this work is to apply the results of R. Gabasov et al. [ 4 , 14 ] to an extended class of optimal control problems in the Bolza form, with intermediate phase constraints and multivariate control. In this paper, the developed iterative numerical method avoids the discretization of the dynamical system. Indeed, by using a piecewise constant control, the problem is reduced for each iteration to a linear programming problem, this auxiliary task allows to improve the value of the quality criterion. The process is repeated until the optimal or the suboptimal control is obtained. As an application, we use this method to solve an extension of the deterministic optimal cash management model of S.P. Sethi [ 31 , 32 ]. In this extension, we assume that the bank overdrafts and short selling of stock are allowed, but within the authorized time limit. The results of the numerical example show that the optimal decision for the firm depends closely on the intermediate moment, the optimal decision for the firm is to purchase until a certain date the stocks at their authorized maximum value in order to take advantage of the returns derived from stock. After that, it sales the stocks at their authorized maximum value in order to satisfy the constraint at the intermediate moment.","PeriodicalId":44957,"journal":{"name":"Numerical Algebra Control and Optimization","volume":"17 1","pages":""},"PeriodicalIF":1.3,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82189027","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 1

Dynamical complexity in a delayed Plankton-Fish model with alternative food for predators 具有捕食者可选择食物的延迟浮游生物-鱼类模型的动态复杂性

IF 1.3

Numerical Algebra Control and Optimization Pub Date : 2021-01-01 DOI: 10.3934/naco.2021036

R. Kaur, Amit Sharma, A. Sharma

{"title":"Dynamical complexity in a delayed Plankton-Fish model with alternative food for predators","authors":"R. Kaur, Amit Sharma, A. Sharma","doi":"10.3934/naco.2021036","DOIUrl":"https://doi.org/10.3934/naco.2021036","url":null,"abstract":"The present manuscript deals with a 3-D food chain ecological model incorporating three species phytoplankton, zooplankton, and fish. To make the model more realistic, we include predation delay in the fish population due to the vertical migration of zooplankton species. We have assumed that additional food is available for both the predator population, viz., zooplankton, and fish. The main motive of the present study is to analyze the impact of available additional food and predation delay on the plankton-fish dynamics. The positivity and boundedness (with and without delay) are proved to make the system biologically valid. The steady states are determined to discuss the stability behavior of non-delayed dynamics under certain conditions. Considering available additional food as a control parameter, we have estimated ranges of alternative food for maintaining the sustainability and stability of the plankton-fish ecosystem. The Hopf-bifurcation analysis is carried out by considering time delay as a bifurcation parameter. The predation delay includes complexity in the system dynamics as it passes through its critical value. The direction of Hopf-bifurcation and stability of bifurcating periodic orbits are also determined using the centre manifold theorem. Numerical simulation is executed to validate theoretical results.","PeriodicalId":44957,"journal":{"name":"Numerical Algebra Control and Optimization","volume":"41 1","pages":""},"PeriodicalIF":1.3,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87020706","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 1

A modified extragradient algorithm for a certain class of split pseudo-monotone variational inequality problem 一类分裂伪单调变分不等式问题的改进外聚算法

IF 1.3

Numerical Algebra Control and Optimization Pub Date : 2021-01-01 DOI: 10.3934/NACO.2021011

G. Ogwo, C. Izuchukwu, O. Mewomo

引用次数: 17

Existence and well-posedness for excess demand equilibrium problems 过剩需求均衡问题的存在性和适定性

IF 1.3

Numerical Algebra Control and Optimization Pub Date : 2021-01-01 DOI: 10.3934/naco.2021043

L. Q. Anh, Pham Thanh Duoc, T. Q. Duy

引用次数: 0

Preconditioned inexact Newton-like method for large nonsymmetric eigenvalue problems 大型非对称特征值问题的预条件非精确类牛顿方法

IF 1.3

Numerical Algebra Control and Optimization Pub Date : 2021-01-01 DOI: 10.3934/NACO.2021012

Hongyi Miao, Li Wang

引用次数: 1

Design of experiment for tuning parameters of an ant colony optimization method for the constrained shortest Hamiltonian path problem in the grid networks 网格网络约束最短哈密顿路径问题蚁群优化方法参数整定实验设计

IF 1.3

Numerical Algebra Control and Optimization Pub Date : 2021-01-01 DOI: 10.3934/naco.2020028

M. Abdolhosseinzadeh, Mir Mohammad Alipour

{"title":"Design of experiment for tuning parameters of an ant colony optimization method for the constrained shortest Hamiltonian path problem in the grid networks","authors":"M. Abdolhosseinzadeh, Mir Mohammad Alipour","doi":"10.3934/naco.2020028","DOIUrl":"https://doi.org/10.3934/naco.2020028","url":null,"abstract":"In a grid network, the nodes could be traversed either horizontally or vertically. The constrained shortest Hamiltonian path goes over the nodes between a source node and a destination node, and it is constrained to traverse some nodes at least once while others could be traversed several times. There are various applications of the problem, especially in routing problems. It is an NP-complete problem, and the well-known Bellman-Held-Karp algorithm could solve the shortest Hamiltonian circuit problem within begin{document}$ {rm O(}{{rm 2}}^{{rm n}}{{rm n}}^{{rm 2}}{rm )} $end{document} time complexity; however, the shortest Hamiltonian path problem is more complicated. So, a metaheuristic algorithm based on ant colony optimization is applied to obtain the optimal solution. The proposed method applies the rooted shortest path tree structure since in the optimal solution the paths between the restricted nodes are the shortest paths. Then, the shortest path tree is obtained by at most begin{document}$ {rm O(}{{rm n}}^{{rm 3}}{rm )} $end{document} time complexity at any iteration and the ants begin to improve the solution and the optimal solution is constructed in a reasonable time. The algorithm is verified by some numerical examples and the ant colony parameters are tuned by design of experiment method, and the optimal setting for different size of networks are determined.","PeriodicalId":44957,"journal":{"name":"Numerical Algebra Control and Optimization","volume":"41 1","pages":""},"PeriodicalIF":1.3,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77499744","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 4