Titlebook: Methodology and Software for Interactive Decision Support; Proceedings of the I Andrzej Lewandowski (Project Leader),Ivan Stanchev Conferen

極力證明

GLUT

Choice of a Subset with Respect to Many CriteriaLet A be a finite set and let several binary preference relations on A be given. Then the problem of determining an order which aggregates the given relations is well known.

Invertebrate

Trends in Interactive Multiple Objective ProgrammingThis paper discusses 25 topics that trace the past, present, and future development of interactive multiple objective programming. Grouped by decade, the topics are as follows:

思考而得

威脅你

Celiac-Plexus

Two-Person Finite Games with Nature Participation and without Messages about its Choicesot on the Nature choice. An approach for finding appropriate strategies for P1 using binary linear programming is proposed. Some possibilities to get estimates of his best guaranteed result are described.

Frenetic

Generalized Reachable Sets Method in Multiple Criteria Problemsformulated as follows. The properties of the open model under study are investigated by means of aggregated variables. The set of all combinations of values of aggregated variables which are accessible (or reachable) using feasible combinations of values of original variables is constructed. This set should be described in explicit form.

keloid

Degeneracy in Efficiency Testing in Bicriteria Integer Programmingility function of the two objectives he wishes to maximize. The problem is solved by an interactive branch-and-bound method in which the decision-maker’s preference structure is explored and determined using pairwise comparison questions.

Omnipotent

終端

0075-8442 ganized jointly by the System and Decision Sciences Program of the International Institute for Applied Sys- tems Analysis (nASA, located in Laxenburg, Austria) and The National Committee for Applied Systems Analysis and Management in Bulgaria. Several other Bulgarian institutions sponsored the Works