A Finite Procedure for Determining if a Quadratic Form is Bounded Below on a Closed Polyhedral Convex Set.

1977 ◽  
Author(s):  
B. Curtis Eaves
Keyword(s):  
Quadratic Form ◽  
Convex Set ◽  
Polyhedral Convex ◽  
Finite Procedure ◽  
Bounded Below ◽  
Polyhedral Convex Set

scholarly journals On two problems over polyhedral convex sets

2015 ◽  
Vol 1 (1) ◽  
pp. 9-15
Author(s):  
Tran Vu Thieu
Keyword(s):  
Convex Sets ◽  
Convex Set ◽  
Linear Constraints ◽  
Concave Programming ◽  
Linear Equality ◽  
Polyhedral Convex ◽  
Polyhedral Convex Sets ◽  
Polyhedral Convex Set

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.

Sign in / Sign up

Export Citation Format

Share Document