On linear systems containing strict inequalities
The authors study convex sets which are solutions of an arbitrary number of weak and strict linear inequalities, equivalently of strict linear inequalities (evenly convex sets). They study similarities between this and the class of closed convex sets and prove a number of specific results. For instance if such a solution set is nonempty then its closure is the solution set of the corresponding weak inequalities. Consistency conditions are given. An evenly convex set is a convex set with the separating hyperplane property. It is obtained from a closed convex set by deleting the union of a certain family of its exposed faces.
- Characterizations of evenly convex sets and evenly quasiconvex functions
- Conjugacy in quasi-convex programming
- Duality between direct and indirect utility functions under minimal hypotheses
- Finite iteration method for evaluation of interior point of algebraic polyhedron and bound for step number
- scientific article; zbMATH DE number 3719909 (Why is no real title available?)
- scientific article; zbMATH DE number 3238144 (Why is no real title available?)
- scientific article; zbMATH DE number 3365044 (Why is no real title available?)
- On infinite systems of linear inequalities
- On Quasi-Convex Duality
- Quasiconvex duality theory by generalized conjugation methods
- Recent contributions to linear semi-infinite optimization
- Solvability and Consistency for Linear Equations and Inequalities
- On linear inequality systems without strongly redundant constraints
- Locally Farkas-Minkowski linear inequality systems
- Necessary and sufficient conditions for strong Fenchel-Lagrange duality via a coupling conjugation scheme
- Evenly convex credal sets
- On systems of vector-valued linear inequalities
- Infimal convolution, c -subdifferentiability, and Fenchel duality in evenly convex optimization
- \(e^{\prime }\)-convex sets and functions: properties and characterizations
- Existence of solutions for a class of bilevel stochastic linear programs
- Set-valued evenly convex functions: characterizations and C-conjugacy
- Some remarks on Greenberg-Pierskalla subdifferentiability of quasiconvex functions
- Even convexity and optimization. Handling strict inequalities
- Dual characterizations of the set containments with strict cone-convex inequalities in Banach spaces
- Even convexity, subdifferentiability, and {\(\Gamma\)}-regularization in general topological vector spaces
- On finite linear systems containing strict inequalities
- Lagrange duality for evenly convex optimization problems
- Analyzing linear systems containing strict inequalities via evenly convex hulls
- On subdifferentials via a generalized conjugation scheme: an application to DC problems and optimality conditions
- Duality for sets of strong Slater points
- Stable strong Fenchel and Lagrange duality for evenly convex optimization problems
- scientific article; zbMATH DE number 3885657 (Why is no real title available?)
- scientific article; zbMATH DE number 5693465 (Why is no real title available?)
- scientific article; zbMATH DE number 1104008 (Why is no real title available?)
- scientific article; zbMATH DE number 4121756 (Why is no real title available?)
- Evenly convex sets, and evenly quasiconvex functions, revisited
- New duality results for evenly convex optimization problems
- A comparison of alternative c-conjugate dual problems in infinite convex optimization
- The e-support function of an e-convex set and conjugacy for e-convex functions
- On Fenchel c -conjugate dual problems for DC optimization: characterizing weak, strong and stable strong duality
- Perturbational approach to duality in evenly convex set-valued optimization
- Existence of solutions in bilevel stochastic linear programming with integer variables in the lower level problem
- Perturbational duality in optimization under evenly convex assumptions
- Separating the solution sets of analytical and polynomial systems
This page was built for publication: On linear systems containing strict inequalities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1863528)