Reliability of operations of grey numbers using kernels

Abstract

Purpose The purpose of this paper is to advance new rules about operations of grey numbers based on kernels and greyness and analyze the reliability of these new operations. Design/methodology/approach A grey number is usually represented as a closed interval or a discrete set of numbers. Based on the definition of traditional grey number, novel rules that grey numbers can be represented as their kernels and associated degrees of greyness are proposed. In new rules, the operation between kernels of grey numbers has significance in the application of grey numbers. The reliability of operations of grey numbers using their kernels and the degrees of greyness derived from kernel operations and their corresponding interval operations are studied. Findings The results show that the novel rules about operation of grey numbers satisfy to the concept of grey system properly. It is useful to calculate the grey degree of grey numbers and the process of calculating is easier than traditional operation rules. Practical implications The method exposed in the paper can be used to calculate each two grey numbers. The grey degree and the calculating results of two grey numbers can be given out easily. The method can also be used to calculate grey numbers more than two. Originality/value The paper succeeds in constructing novel operation rules of grey numbers. The reliability of novel operation rules is studied and it is new development of grey systems theory, undoubtedly.

Cite this work

No public copy is stored for this record, so only the metadata is cited.

Stored only when both papers are in the corpus — 42 citations exist upstream.

Papers that cite the same references — the relational fallback while embeddings are still backfilling.