STABILITY ANALYSIS OF A NON-LINEAR HARVESTING MODEL WITH TAXATION
Journal Title: Bulletin of Pure and Applied Sciences Sec. E - Mathematics and Statistics - Year 2018, Vol 37, Issue 2
Abstract
This paper formulates and analyzes a non-linear harvesting of prey, considered in a prey-predator system. Here, the effort is taken as a dynamic variable. Mathematical analysis of the model system includes the existence, uniqueness and uniform boundedness of the solutions in the positive octant. Authoritarian agency has power over exploitation by striking a tax per unit biomass of the prey species. The conditions for the existence of the positive steady states of the model system are derived. Also the local and global stabilities of several equilibrium points are studied using the Routh Hurwitz criteria and Lyapunov function respectively. Numerical simulations are performed by making use of MATLAB to justify the analytical conclusions.
Authors and Affiliations
Md. Manarul Haque
Keywords
Related Articles
- EP ID EP531781
- DOI 10.5958/2320-3226.2018.00044.9
- Views 130
- Downloads 0
DETERMINATION OF OPTIMAL RESERVE BETWEEN TWO MACHINES IN SERIES WITH THE REPAIR TIME HAS CHANGE OF PARAMETER AFTER THE TRUNCATION POINT
In inventory control, suitable models for various real life systems are constructed with the objective of determining the optimal inventory level. A new type of inventory model using the so-called Setting the Clock Back...
ON DIVISOR CORDIAL GRAPH
In this paper we prove that some known graphs such as the Herschel graph and some graphs constructed in this paper are divisor cordial graphs.
A Condition on the Masses of Composite Particles
Based on the recent formulation of the standard model with the spinor space given by a direct sum of tensor products of modules isomorphic to division algebras, these algebras are used to derive an expression for masses...
VARIANCE BALANCED INCOMPLETE BLOCK DESIGNS
This paper provides two new series for the construction for General Efficiency Balanced Incomplete Block Design using the combinatorial arrangement of Efficiency Balanced Incomplete Block Designs.
Common Fixed Point for Compatible Mappings of Type () Satisfying an Implicit Relation
Here we prove a common fixed point theorem for compatible mappings of type () satisfying an implicit relation. We extend results of Popa [9] for five mappings.