On prime and minimal representations of a face of a polyhedron

In this paper, a new method for determining all minimal representations of a face of a polyhedron is proposed. A main difficulty for determining prime and minimal representations of a face is that the deletion of one redundant constraint can change the redundancy of other constraints. To reduce computational efforts in finding all minimal representations … Read more

A new bottom-up search method for determining all maximal efficient faces in multiple objective linear programming

Bottom-up search methods for determining the efficient set of a multiple objective linear programming (MOLP) problem have a valuable advantage that they can quickly give efficient subsets of the MOLP problem to the decision makers. Main difficulties of the previously appeared bottom-up search methods are finding all efficient extreme points adjacent to and enumerating all … Read more