Simple Search

Query:

Enter a query and click »Search«...

Format:

Display: entries per page entries

Zbl 1062.90032
Getachew, Teodros; Kostreva, Michael M.
A dimension-reduction algorithm for multi-stage decision problems with returns in a partially ordered set. (English)
[J] RAIRO, Oper. Res. 36, No. 3, 175-190 (2002). ISSN 0399-0559; ISSN 1290-3868/e

Summary: A two-stage algorithm for finding nondominated subsets of partially ordered sets is established. A connection is then made with dimension reduction in time-dependent dynamic programming via 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 of ``real" valued decisions. A computational application to time-dependent fuzzy dynamic programming is presented.

MSC 2000:: *90B50 Multiple-criteria decision making
90B10 Flows in networks

Keywords: multi-criteria optimization; time-variant networks; dimension reduction

Comment on this Item PDF MathML XML ASCII DVI PS BibTeX Online Ordering Article Article Article Journal

	Scientific prize winners of the ICM 2010
	Overhang
	Lie groups, physics and geometry. An introduction for physicists, engineers and chemists.

Simple Search

Zentralblatt MATH Berlin [Germany]