Analyzing linear systems containing strict inequalities via evenly convex hulls
From MaRDI portal
Publication:2572879
DOI10.1016/j.ejor.2003.12.028zbMath1079.90100MaRDI QIDQ2572879
Margarita M. L. Rodríguez, Miguel Angel Goberna
Publication date: 4 November 2005
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10045/8136
Convex programming; Linear programming; Existence theorems; Consequence relations; Evenly convex hull
Related Items
Evenly convex sets, and evenly quasiconvex functions, revisited, A comparison of alternative c-conjugate dual problems in infinite convex optimization, Lagrange duality for evenly convex optimization problems, Duality for closed convex functions and evenly convex functions, The e-support function of an e-convex set and conjugacy for e-convex functions, On set containment characterization and constraint qualification for quasiconvex programming, Set containment characterization with strict and weak quasiconvex inequalities, Set containment characterization for quasiconvex programming, Infimal convolution, \( c \)-subdifferentiability, and Fenchel duality in evenly convex optimization, Even convexity, subdifferentiability, and {\(\Gamma\)}-regularization in general topological vector spaces, On finite linear systems containing strict inequalities, Dual characterizations of set containments with strict convex inequalities
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Recent contributions to linear semi-infinite optimization
- Set containment characterization
- Characterizations of evenly convex sets and evenly quasiconvex functions
- On linear systems containing strict inequalities
- On infinite systems of linear inequalities
- Duality between direct and indirect utility functions under minimal hypotheses
- Solvability and Consistency for Linear Equations and Inequalities
- Conjugacy in quasi-convex programming
- Quasiconvex duality theory by generalized conjugation methods
- An Extension of the Nonhomogeneous Farkas Theorem
- Characterizing Set Containments Involving Infinite Convex Constraints and Reverse-Convex Constraints
- Mathematical Programming for Data Mining: Formulations and Challenges
- On Quasi-Convex Duality