⎯In this paper we propose a methodology for the solution of multiobjective programming problem with fuzzy relational equations (FRE’s) as constraints. In the first part of the proposed methodology, we find the feasible solution set of FRE’s and give an algorithm to compute minimal solutions and maximal solutions of objective functions which can also be computed by constructed computer program a...

This paper presents how the mixed 0-1 programming in the framework of goal programming (GP) can be used to solve interval-valued fractional bilevel programming (IVFBLP) problems by employing genetic algorithm (GA) in a hierarchical decision making system. In the model formulation of the problem, a goal achievement function for minimizing the lower-bounds of the necessary regret intervals define...

Internet Protocol version 6 (IPv6) attempted to resolve some of the outstanding issues surrounding IP packet fragmentation. However, even under the new standard situations may still arise where packet fragmentation results in seriously degraded performance. Using Opnet 9, we analyze a specific instance of this problem where misconfiguration or poor programming in higher network layers compromis...

In the most abstract definition of its operational semantics, the declarative and concurrent programming language CHR is trivially non-terminating for a significant class of programs. Common refinements of this definition, in closing the gap to real-world implementations, compromise on declarativity and/or concurrency. Building on recent work and the notion of persistent constraints, we introdu...

MapReduce is a programming model for data-parallel programs originally intended for data centers. MapReduce simplifies parallel programming, hiding synchronization and task management. These properties make it a promising programming model for future processors with many cores, and existing MapReduce libraries such as Phoenix have demonstrated that applications written with MapReduce perform co...

This paper extended TOPSIS (Technique for Order Preference by Similarity Ideal Solution) method for solving Two-Level Large Scale Linear Multiobjective Optimization Problems with Stochastic Parameters in the righthand side of the constraints (TL-LSLMOP-SP)rhs of block angular structure. In order to obtain a compromise ( satisfactory) solution to the (TL-LSLMOP-SP)rhs of block angular structure ...

Parallel programs executing on non-dedicated SMPs should be adaptive, that is, they should be able to execute on a dynamically varying environment without loss of efficiency. This paper defines a unified set of services, implemented at the operating system level, which can be used to embed adaptability in any thread-based programming paradigm. These services meet simultaneously three goals: the...

The review of existing human resource allocation models for a CPA firm shows that there are major shortcomings in the previous mathematical models. First, linear programming models cannot handle multiple objective human resource allocation problems for a CPA firm. Second, goal programming or multiple objective linear programming (MOLP) cannot deal with the organizational differentiation problem...