Method of extreme points: Characteristics of feasible sets for forecast of population dynamics

نویسنده

  • L. V. Nedorezov
چکیده

In current publication within the framework of method of extreme points various characteristics of feasible sets are applied for forecast of population dynamics. Following characteristics were used: maximum, minimum and average values for all trajectories with parameters belonging to feasible set, trajectory with best characteristics for Kolmogorov Smirnov criterion, and trajectory with lowest value of sum of squared deviations between theoretical and empirical values. Analyses were provided for larch bud moth population (Zeiraphera diniana Gn.) time series (GPDD 1407; sample size is 38) and for Moran – Ricker model. Time series was divided onto two parts: for first part (first 21 values or more) feasible sets were determined and for tails of time series pointed out characteristics were applied. Forecasting properties of used characteristics are under discussion.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

C*-Extreme Points and C*-Faces oF the Epigraph iF C*-Affine Maps in *-Rings

Abstract. In this paper, we define the notion of C*-affine maps in the unital *-rings and we investigate the C*-extreme points of the graph and epigraph of such maps. We show that for a C*-convex map f on a unital *-ring R satisfying the positive square root axiom with an additional condition, the graph of f is a C*-face of the epigraph of f. Moreover, we prove som...

متن کامل

Characterization of efficient points of the production possibility set under variable returns to scale in DEA

  We suggest a method for finding the non-dominated points of the production possibility set (PPS) with variable returns to scale (VRS) technology in data envelopment analysis (DEA). We present a multiobjective linear programming (MOLP) problem whose feasible region is the same as the PPS under variable returns to scale for generating non-dominated points. We demonstrate that Pareto solutions o...

متن کامل

Finding the Best Coefficients in the Objective Function of a Linear Quadratic Control Problem

Finding the best weights of the state variables and the control variables in the objective function of a linear-quadratic control problem is considered. The weights of these variables are considered as two diagonal matrices with appropriate size and so the objective function of the control problem becomes a function of the diagonal elements of these matrices. The optimization problem which is d...

متن کامل

Type-2 fuzzy set extension of DEMATEL method combined with perceptual computing for decision making

Most decision making methods used to evaluate a system or demonstrate the weak and strength points are based on fuzzy sets and evaluate the criteria with words that are modeled with fuzzy sets. The ambiguity and vagueness of the words and different perceptions of a word are not considered in these methods. For this reason, the decision making methods that consider the perceptions of decision...

متن کامل

Simplicial Decomposition Al- Gorithms

Simplicial decomposition (SD) is a class of methods for solving continuous problems in mathematical programming with convex feasible sets. There are two main characteristics of the methods in this class: (i) an approximation of the original problem is constructed and solved, wherein the original feasible set is replaced by a polyhedral subset thereof, that is, an inner approximation of it which...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015