On two problems over polyhedral convex sets

Tran Vu Thieu
Author affiliations

Authors

  • Tran Vu Thieu

DOI:

https://doi.org/10.15625/1813-9663/1/1/6661

Abstract

In this paper, we are concerned with the following two problems often encountered in concave programming:

  1. 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.
  2. 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.

Metrics

Metrics Loading ...

Downloads

How to Cite

[1]
T. V. Thieu, “On two problems over polyhedral convex sets”, JCC, vol. 1, no. 1, pp. 9–15, Aug. 2015.

Issue

Section

Computer Science