Faces of a polyhedron

DOI10.1007/BFb0121041zbMath0591.90082MaRDI QIDQ3720315

Katta G. Murty

Publication date: 1985

Published in: Mathematical Programming Essays in Honor of George B. Dantzig Part I (Search for Journal in Brave)

zbMATH Keywords

multiobjective linear programmingefficient facescomputation of incident facesdegenerate extreme point

Mathematics Subject Classification ID

Sensitivity, stability, parametric optimization (90C31) Linear programming (90C05) Polytopes and polyhedra (52Bxx)

Related Items

Maximal descriptor set characterizations of efficient faces in multiple objective linear programming., A new method for determining all maximal efficient faces in multiple objective linear programming, A bilinear algorithm for optimizing a linear function over the efficient set of a multiple objective linear programming problem, The maximal descriptor index set for a face of a convex polyhedral set and some applications, Bounds on the number of vertices of perturbed polyhedra, Finding all maximal efficient faces in multiobjective linear programming