2024-11-1020000025-5610N/A2-s2.0-0012932582N/Ahttps://hdl.handle.net/20.500.14288/17352One way of solving multiple objective mathematical programming problems is ending discrete representations of the efficient set. A modified goal of finding good discrete representations of thr efficient set would contribute to the practicality of vector maximization algorithms. We define coverage, uniformity and cardinality as the three attributes of quality of discrete representations and introduce a framework that includes these attributes in which discrete representations can be evaluated, compared to each other, and judged satisfactory or unsatisfactory by a Decision Maker. We provide simple mathematical programming formulation that can he used to compute the coverage error of a given discrete representation. Our formulations are practically implementable when the problem under study is a multiobjective linear programming problem. We believe that the interactive algorithms along with the vector maximization methods can make use of our framework and its tools.Computer science, software engineeringOperations researchManagement scienceMathematics, appliedJournal Article87422900011Q113054