Previous Page 5

Displaying 81 – 100 of 100

Showing per page

Fuzzy Linear Fractional Set Covering Problem with Imprecise Costs

Rashmi Gupta, Ratnesh Rajan Saxena (2014)

RAIRO - Operations Research - Recherche Opérationnelle

Set covering problems are in great use these days, these problems are applied in many disciplines such as crew scheduling problems, location problems, testing of VLSI circuits, artificial intelligence etc. In this paper α-acceptable optimal solution is given for the fuzzy linear fractional set covering problem where fuzziness involved in the objective function. At first the fuzzy linear fractional problem is being converted in to crisp parametric linear fractional set covering problem then a linearization...

Fuzzy linear programming via simulated annealing

Rita Almeida Ribeiro, Fernando Moura Pires (1999)

Kybernetika

This paper shows how the simulated annealing (SA) algorithm provides a simple tool for solving fuzzy optimization problems. Often, the issue is not so much how to fuzzify or remove the conceptual imprecision, but which tools enable simple solutions for these intrinsically uncertain problems. A well-known linear programming example is used to discuss the suitability of the SA algorithm for solving fuzzy optimization problems.

Fuzzy Mathematical Programming approach for Solving Fuzzy Linear Fractional Programming Problem

Chinnadurai Veeramani, Muthukumar Sumathi (2014)

RAIRO - Operations Research - Recherche Opérationnelle

In this paper, a solution procedure is proposed to solve fuzzy linear fractional programming (FLFP) problem where cost of the objective function, the resources and the technological coefficients are triangular fuzzy numbers. Here, the FLFP problem is transformed into an equivalent deterministic multi-objective linear fractional programming (MOLFP) problem. By using Fuzzy Mathematical programming approach transformed MOLFP problem is reduced single objective linear programming (LP) problem. The proposed...

Fuzzy termination criteria in Knapsack Problem algorithms.

José Luis Verdegay, Edmundo Vergara-Moreno (2000)

Mathware and Soft Computing

Fuzzy rule based termination criteria are introduced in two conventional and exact algorithms solving Knapsack Problems. As a consequence two new solution algorithms are obtained. These algorithms are heuristic ones with a high performance. The efficiency of the algorithms obtained is illustrated by solving some numerical examples.

Currently displaying 81 – 100 of 100

Previous Page 5