| Article ID: | iaor1992708 |
| Country: | Spain |
| Volume: | 6 |
| Start Page Number: | 71 |
| End Page Number: | 82 |
| Publication Date: | Nov 1991 |
| Journal: | Trabajos de Investigacion Operativa |
| Authors: | Laguna Juan Garcia |
In this paper a generalization of the extreme points characterization in the polyhedron of feasible solutions is found in the standard problem of Linear Programming. To that purpose, an extension of the concept of face given by Goldman and Tucker for polyhedral convex cones is used, which differs from that exposed in most classical treatises (Grünbaum, Mullen-Shepard, Stoer-Witzgall, ...).