In this paper, linear fractional programming problems have been extended to neutrosophic sets, and the operations functionality of these laws are studied. Moreover, new algorithm is based on aggregation ranking function arithmetic triangular sets. Furthermore, in we take up a problem where constraints both equality inequality fuzzy number. Lead from genuine issue, few numerical models considere...

We propose a distributed algorithm to solve dynamic programming problem with multiple agents, where each agent has only partial knowledge of the state transition probabilities and costs. provide consensus proofs for presented derive error bounds obtained value function respect what is considered as "true solution" from conventional iteration. To minimize communication overhead between costs are...

In the Universal Facility Location problem we are given a set of demand points and a set of facilities. The goal is to assign the demands to facilities in such a way that the sum of service and facility costs is minimized. The service cost is proportional to the distance each unit of demand has to travel to its assigned facility, whereas the facility cost of each facility i depends on the amoun...

We present a general aggregation method applicable to all finite-horizon Markov decision problems. States of the MDP are aggregated into macro-states based on a pre-selected collection of “distinguished” states which serve as entry points into macro-states. The resulting macro-problem is also an MDP, whose solution approximates an optimal solution to the original problem. The aggregation scheme...

This dissertation presents a descriptive notation for data structures which is embedded in a programming language in such a way that the resulting language behaves as a synthetic tool for describing data and processes in a number of application areas. A series of examples including formulae, lists, flow charts, Algol text, files, matrices, organic molecules and complex variables is presented to...