Fuzzy numbers are used in various fields such as fuzzy process methods, decision control theory, problems involving decision making, and systematic reasoning. Fuzzy systems, including fuzzy set theory. In this paper, pentagonal fuzzy variables (PFV) are used to formulate linear programming problems (LPP). Here, we will concentrate on an approach to addressing these issues that uses the simplex technique (SM). Linear programming problems (LPP) and linear programming problems (LPP) with pentagonal fuzzy numbers (PFN) are the two basic categories into which we divide these issues. The focus of this paper is to find the optimal solution (OS) for LPP with PFN on the objective function (OF) and right-hand side. New ranking function (RF) approaches for solving fuzzy linear programming problems (FLPP) with a pentagonal fuzzy number (PFN) have been proposed, based on new ranking functions (N RF). The simplex method (SM) is very easy to understand. Finally, numerical examples (NE) are used to demonstrate the suggested approach's computing process.
The purpose behind building the linear regression model is to describe the real linear relation between any explanatory variable in the model and the dependent one, on the basis of the fact that the dependent variable is a linear function of the explanatory variables and one can use it for prediction and control. This purpose does not cometrue without getting significant, stable and reasonable estimatros for the parameters of the model, specifically regression-coefficients. The researcher found that "RUF" the criterian that he had suggested accurate and sufficient to accomplish that purpose when multicollinearity exists provided that the adequate model that satisfies the standard assumpitions of the error-term can be assigned. It
... Show More This paper studies the existence of positive solutions for the following boundary value problem :-
y(b) 0 α y(a) - β y(a) 0 bta f(y) g(t) λy    ï‚¢ï€
The solution procedure follows using the Fixed point theorem and obtains that this problem has at least one positive solution .Also,it determines ( ï¬ ) Eigenvalue which would be needed to find the positive solution .
In this paper, we studied the scheduling of jobs on a single machine. Each of n jobs is to be processed without interruption and becomes available for processing at time zero. The objective is to find a processing order of the jobs, minimizing the sum of maximum earliness and maximum tardiness. This problem is to minimize the earliness and tardiness values, so this model is equivalent to the just-in-time production system. Our lower bound depended on the decomposition of the problem into two subprograms. We presented a novel heuristic approach to find a near-optimal solution for the problem. This approach depends on finding efficient solutions for two problems. The first problem is minimizing total completi
... Show MoreThe swarm intelligence and evolutionary methods are commonly utilized by researchers in solving the difficult combinatorial and Non-Deterministic Polynomial (NP) problems. The N-Queen problem can be defined as a combinatorial problem that became intractable for the large ‘n’ values and, thereby, it is placed in the NP class of problems. In the present study, a solution is suggested for the N-Queen problem, on the basis of the Meerkat Clan Algorithm (MCA). The problem of n-Queen can be mainly defined as one of the generalized 8-Queen problem forms, for which the aim is placing 8 queens in a way that none of the queens has the ability of killing the others with the use of the standard moves of the chess queen. The Meerkat Clan environm
... Show MoreAs of late, humankind has experienced radiation issues either computerized tomography (CT) or X-rays. In this investigation, we endeavor to limit the effect of examination hardware. To do this the medical image is cropping (cut and zoom) then represented the vascular network as a graph such that each contraction as the vertices and the vessel represented as an edges, the area of the coagulation was processed already, in the current search the shortest distance to reach to the place of the blood vessel clot is computed