A problem in enumerating extreme points, and an efficient algorithm for one class of polytopes

DOI10.1007/s11590-008-0103-8zbMath1167.90585OpenAlexW1989485640MaRDI QIDQ1024731

Katta G. Murty

Publication date: 17 June 2009

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-008-0103-8

zbMATH Keywords

adjacencysegmentsnearest pointsconvex polytopes and their dual polytopesfacetal constraint functionsmukkas

Mathematics Subject Classification ID

Linear programming (90C05)

Related Items (1)

A common formula to compute the efficient sets of a class of multiple objective linear programming problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra
• Efficient enumeration of the vertices of polyhedra associated with network LP's
• Facets of an assignment problem with 0-1 constraint
• Segments in enumerating faces
• Adjacency on Convex Polyhedra
• Generating all vertices of a polyhedron is hard

This page was built for publication: A problem in enumerating extreme points, and an efficient algorithm for one class of polytopes