Exceptional families and finite-dimensional variational inequalities over polyhedral convex sets

1997 ◽  
Vol 87 (2-3) ◽  
pp. 111-126 ◽  
Author(s):  
Yun-Bin Zhao
Keyword(s):  
Variational Inequalities ◽  
Convex Sets ◽  
Finite Dimensional ◽  
Polyhedral Convex ◽  
Polyhedral Convex Sets ◽  
Exceptional Families

Outer approximation by polyhedral convex sets

OR Spectrum ◽  
1987 ◽  
Vol 9 (3) ◽  
pp. 153-159 ◽  
Author(s):  
R. Horst ◽  
Ng. V. Thoai ◽  
H. Tuy
Keyword(s):  
Convex Sets ◽  
Outer Approximation ◽  
Polyhedral Convex ◽  
Polyhedral Convex Sets

scholarly journals Connectedness of Solution Sets for Weak Vector Variational Inequalities on Unbounded Closed Convex Sets

2013 ◽  
Vol 2013 ◽  
pp. 1-5
Author(s):  
Ren-you Zhong ◽  
Yun-liang Wang ◽  
Jiang-hua Fan
Keyword(s):  
Variational Inequality ◽  
Variational Inequalities ◽  
Convex Sets ◽  
Vector Variational Inequality ◽  
Vector Variational Inequalities ◽  
Solution Set ◽  
Solution Sets ◽  
Finite Dimensional ◽  
Path Connectedness ◽  
Weak Vector

We study the connectedness of solution set for set-valued weak vector variational inequality in unbounded closed convex subsets of finite dimensional spaces, when the mapping involved is scalarC-pseudomonotone. Moreover, the path connectedness of solution set for set-valued weak vector variational inequality is established, when the mapping involved is strictly scalarC-pseudomonotone. The results presented in this paper generalize some known results by Cheng (2001), Lee et al. (1998), and Lee and Bu (2005).

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.

scholarly journals A ``hidden'' characterization of polyhedral convex sets

2011 ◽  
Vol 206 (1) ◽  
pp. 63-74
Author(s):  
Taras Banakh ◽  
Ivan Hetman
Keyword(s):  
Convex Sets ◽  
Polyhedral Convex ◽  
Polyhedral Convex Sets
Sign in / Sign up

Export Citation Format

Share Document