On two problems over polyhedral convex sets
2015 ◽
Vol 1
(1)
◽
pp. 9-15
Keyword(s):
In this paper, we are concerned with the following two problems often encountered in concave programming: Given the vertices and extreme detections of a polyhedral convex set Modefined by a system of linear constraints, determine the vertices and extreme directions of the polyhedral convex set obtained from M just by adding one new linear equality (or inequality) constraint.Among the constraints of a given polyhedral convex set, find those which are redundant, i.e. which can be removed without affecting the polyhedral convex set.
Keyword(s):
Keyword(s):
1996 ◽
Vol 6
(4)
◽
pp. 1087-1105
◽
Keyword(s):
2012 ◽
Vol 157
(1)
◽
pp. 25-43
◽
1997 ◽
Vol 15
(5)
◽
pp. 728-735
◽
Keyword(s):
Keyword(s):
Keyword(s):
Keyword(s):