For some management programming problems, multiple objectives to be optimized rather than a single objective, and objectives can be expressed with ratio equations such as return/investment, operating profit/net-sales, profit/manufacturing cost, etc. In this paper, we proposed the transformation characteristics to solve the multi objective linear fractional programming (MOLFP) problems. If a MOL...

In this paper we present work aimed at implementing an efficient parallel model for the three-dimensional Voronoi cell finite element model (VCFEM), which has been developed as an effective tool for modeling heterogeneous microstructures of composite, porous or polycrystalline materials, on SMP cluster systems. In these systems, multiprocessor nodes offer shared memory on the node and distribut...

Consider the nonlinear fractional programming problem max{f(x)lg(x)lxES}, where g(x»O for all XES. Jagannathan and Dinkelbach have shown that the maximum of this problem is equal to ~O if and only if max{f(x)-~g(x) IXES} is 0 for ~=~O. 1 t t Based on this result, we treat here a special case: f(x)=Zx Cx+r x+s, g(X)=~ xtDX+ptX+q and S is a polyhedron, where C is negative definite and D is positi...

This paper addresses the problem of linear-fractional programming under uncertainty. The uncertainty here is understood as ambiguity coefficients’ values in optimized functional. We give two mathematical formulations problem. In first one, refers to numerator: there are several sets objective function coefficients, each coefficient can determine numerator problem’s criterion at stage its soluti...

Here, we consider single vendor-buyer model with multi-product and multi-customer and multi-facility location-production-distribution problem. It is assumed that the players of the supply chain are coordinated by sharing information. Vendor manufactures produce different products at different plants with limited capacities and then distribute the products to the consumers according to determini...

In the present paper we present a new method for solving a class of single stage single constraints linear fractional programming (LFP) problem. The proposed method is based on transformation the objective value and the constraints also. After reducing the fractional program in to equivalent linear program with the help of transformation technique, after that we apply Simplex method to find obj...

In an earlier work [Pop and Stancu Minasian, 2008], we proposed a method of solving the fully fuzzified linear fractional programming (FFLFP) problem. In this paper, we propose another method of solving the FFLFP problem. First, analogically using the Charnes-Cooper method, we transform the linear fractional programming problem into a linear one. Next, problem of maximizing a function with tria...

This paper presents a general methodology for implementing on clusters the runtime support for a two-level dependence-driven thread model, initially targeted to shared-memory multiprocessors. The general ideal is to exploit existing programming solutions for these architectures, like Software DSM (SWDSM) and Message Passing Interface. The management of the internal runtime system structures and...