GALGOTIAS UNIVERSITY

Plot No.2, Sector -17 A, Yamuna Expressway,

Greater Noida, Gautam Buddh Nagar, U.P., India

CAT-3 Case Study Report File Submission

KEYWORDS
 Abstract

 Introduction

 Problem

 Rules for Hasse diagram

 References

ABSTRACT
Monte Carlo simulations are well known within risk assessments similarly there is some

interest in applying simple elements of partial order theory in the field of decision

analysis, ranking and evaluation. Much criticism concerning the application of partial

order to data matrices originates from the translation of even small numerical

differences of data into instances of partial order theory. It is mainly the appearance of

incomparability that is often seen as being a disadvantage, especially when the data

differences are considered irrelevant for ranking purposes. Several attempts to improve

this situation have already been reported in the literature. The most effective approach

to date is the fuzzy approach which, however, also has its disadvantages. For this

reason, in this paper we combine Monte Carlo simulations with instances of partial order

theory, namely the concept of dominance and separability of subsets into partially

ordered sets. The example is taken from a well-known set of data, namely High

Production Volume Chemicals (HPVC).

INTRODUCTION
 HASSE DIAGRAM

A Hasse diagram is a graphical representation of the relation of elements of a partially ordered

set (poset) with an implied upward orientation. A point is drawn for each element of the partially

ordered set (poset) and joined with the line segment according to the following rules:

 If p<q in the poset, then the point corresponding to p appears lower in the drawing than

the point corresponding to q.

 The two points p and q will be joined by line segment iff p is related to q.

To draw a Hasse diagram, provided set must be a poset.

A poset or partially ordered set A is a pair, ( B, ≤) of a set B whose elements are called the

vertices of A and obeys following rules:

Reflexivity → p ≤p∀p∈ B

Anti-symmetric → p≤q and q ≤p iff p=q

Transitivity → if p≤qand q≤r then p≤r

Partial Ordered Set

partially ordered set is defined as an ordered pair P=(X,<=), where X is called the ground set of P

and <= is the partial order of P.

An element u in a partially ordered set (X,<=) is said to be an upper bound for a subset S of X if

for every s in S, we have s<=u. Similarly, a lower bound for a subset S is an element l such that

for every s in S, l<=s. If there is an upper bound and a lower bound for X, then the poset (X,<=)

is said to be bounded.
 Problems

Example-1: Draw Hasse diagram for ({3, 4, 12, 24, 48, 72}, /)

Explanation – According to above given question first, we have to find the poset

for the divisibility.

Let the set is A.

A={(3 ¬12), (3¬24), (3¬48), (3¬72), (4 ¬12), (4¬24), (4¬48), (4¬72), (12¬24),

(12¬48), (12¬72), (24¬48), (24¬72)}

So, now the Hasse diagram will be:

In above diagram, 3 and 4 are at same level because they are not related to each other

and they are smaller than other elements in the set. The next succeeding element for 3

and 4 is 12 i.e, 12 is divisible by both 3 and 4. Then 24 is divisible by 3, 4 and 12.

Hence, it is placed above 12. 24 divides both 48 and 72 but 48 does not divide 72.

Hence 48 and 72 are not joined. We can see transitivity in our diagram as the level is

increasing.
 Rules for Hasse diagram

For regular Hasse Diagram:

Maximal element is an element of a POSET which is not less than any other

element of the POSET. Or we can say that it is an element which is not related to

any other element. Top elements of the Hasse Diagram.

Example- In the diagram above, we can say that 4,2,3,6,1 are related to 12

(ordered by division e.g. (4,/) ) but 12 is not related to any other. (As Hasse

Diagram is upward directional).

Minimal element is an element of a POSET which is not greater than any other

element of the POSET. Or we can say that no other element is related to this

element. Bottom elements of the Hasse Diagram.

Example- In the diagram above, we can say that 1 is related to 2,3,4,6,12

(ordered by division e.g. (4,/) ) but no element is related to 1. (As Hasse Diagram

is upward directional).

Greatest element (if it exists) is the element succeeding all other elements.

Least element is the element that precedes all other elements.

Note – Greatest and Least element in Hasse diagram are only one.

References
[1] P. Annoni, R. Bruggemann, A. Saltelli, Partial order investigation of multiple indicator systems using
variance-based sensitivity analysis, Env. Mod. Software 26 (2011) 950–958.
[2] J. P. Brans, P. H. Vincke, A preference ranking organisation method (The PROMETHEE method for
multiple criteria decision - making), Manag. Sci. 31 (1985) 647–656.
[3] R. Bruggemann, G. P. Patil, Multicriteria prioritization and partial order in environmental sciences,
Environ. Ecolog. Stat. 17 (2010) 383–410.

[4] R. Bruggemann, G. P. Patil, Ranking and Prioritization for Multi–indicator Systems — Introduction
to Partial Order Applications, Springer, New York, 2011.

[5] R. Bruggemann, K. Voigt, A new tool to analyze partially ordered sets. Application: ranking of
polychlorinated biphenyls and alkanes/alkenes in river Main, Germany, MATCH Commun. Math.
Comput. Chem. 66 (2011) 231–251.