A variety of Software Reliability Growth Models (SRGM) have been presented in literature. These models suffer many problems when handling various types of project. The reason is; the nature of each project makes it difficult to build a model which can generalize. In this paper we propose the use of Genetic Programming (GP) as an evolutionary computation approach to handle the software reliabili...

The fuzzy linear regression model with fuzzy input-output data andcrisp coefficients is studied in this paper. A linear programmingmodel based on goal programming is proposed to calculate theregression coefficients. In contrast with most of the previous works, theproposed model takes into account the centers of fuzzy data as animportant feature as well as their spreads in the procedure ofconstr...

Nowadays, interval comparison matrices (ICM) take an important role in decision making under uncertainty. So it seems that a brief review on solution methods used in ICM should be useful. In this paper, the common methods are divided into four categories that are Goal Programming Method (GPM), Linear Programming Method (LPM), Non-Linear Programming Method (NLPM) and Statistic Analysis (SA). GPM...

Abstract It is the purpose of this article to introduce a linear approximation technique for solving a fractional chance constrained programming (CC) problem. For this purpose, a fuzzy goal programming model of the equivalent deterministic form of the fractional chance constrained programming is provided and then the process of defuzzification and linearization of the problem is started. A sam...

In recent years different genetic programming (GP) structures have emerged. Today, the basic forms of representation for genetic programs are tree, linear and graph structures. In this contribution we introduce a new kind of GP structure which we call linear-graph. This is a further development to the linear-tree structure that we developed earlier. We describe the linear-graph structure, as we...

Linear goal programming can be used as a complementary technique when local moment matching method up to the second moment gives some negative mass. This could happen when manipulating a discrete or mixed type severity distribution. In that case we can avoid a simple retreat to the first moment and look for an arithmetic distribution with equal mean and the second moment closest to that of the ...

This paper is devoted to the explanation of a new methodology in bonus malus system design, capable of taking into account very well known theoretical conditions like fairness and ...nancial equilibrium of the portfolio, in addition to market conditions that could ...t the resulting scale of premiums into competitive commercial settings. This is done through the resolution of a classical Bayesi...

The transient flow analyzing by the frequency domain method (FDM) is computationally much faster than the method of characteristic (MOC) in the time domain. FDM needs no discretization in time and space, but requires the linearization of governing equations and boundary conditions. Hence, the FDM is only valid for small perturbations in which the system’s hydraulics is almost linear. In this st...