Displaying similar documents to “A dimension-reduction algorithm for multi-stage decision problems with returns in a partially ordered set”

A Dimension-Reduction Algorithm for Multi-Stage Decision Problems with Returns in a Partially Ordered Set

Teodros Getachew, Michael M. Kostreva (2010)

RAIRO - Operations Research

Similarity:

In this paper a two-stage algorithm for finding non- dominated subsets of partially ordered sets is established. A connection is then made with dimension reduction in time-dependent dynamic programming the notion of a bounding label, a function that bounds the state-transition cost functions. In this context, the computational burden is partitioned between a time-independent dynamic programming step carried out on the bounding label and a direct evaluation carried out on a subset...

Fuzzy termination criteria in Knapsack Problem algorithms.

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

Mathware and Soft Computing

Similarity:

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.

Linear optimization with bipolar max-parametric hamacher fuzzy relation equation constraints

Samaneh Aliannezhadi, Ali Abbasi Molai, Behnaz Hedayatfar (2016)

Kybernetika

Similarity:

In this paper, the linear programming problem subject to the Bipolar Fuzzy Relation Equation (BFRE) constraints with the max-parametric hamacher composition operators is studied. The structure of its feasible domain is investigated and its feasible solution set determined. Some necessary and sufficient conditions are presented for its solution existence. Then the problem is converted to an equivalent programming problem. Some rules are proposed to reduce the dimensions of problem. Under...

Extended VIKOR as a new method for solving Multiple Objective Large-Scale Nonlinear Programming problems

Majeed Heydari, Mohammad Kazem Sayadi, Kamran Shahanaghi (2010)

RAIRO - Operations Research

Similarity:

The VIKOR method was introduced as a Multi-Attribute Decision Making (MADM) method to solve discrete decision-making problems with incommensurable and conflicting criteria. This method focuses on ranking and selecting from a set of alternatives based on the particular measure of “closeness” to the “ideal” solution. The multi-criteria measure for compromise ranking is developed from the – metric used as an aggregating function in a compromise programming method. In this paper, the...

Consistency checking within local search applied to the frequency assignment with polarization problem

Michel Vasquez, Audrey Dupont, Djamal Habet (2003)

RAIRO - Operations Research - Recherche Opérationnelle

Similarity:

We present a hybrid approach for the Frequency Assignment Problem with Polarization. This problem, viewed as Max-CSP, is treated as a sequence of decision problems, CSP like. The proposed approach combines the Arc-Consistency techniques with a performed Tabu Search heuristic. The resulting algorithm gives some high quality solutions and has proved its robustness on instances with approximately a thousand variables and nearly ten thousand constraints.