Analyzing linear systems containing strict inequalities via evenly convex hulls

DOI10.1016/j.ejor.2003.12.028zbMath1079.90100OpenAlexW2079480909MaRDI 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

zbMATH Keywords

Convex programmingLinear programmingExistence theoremsConsequence relationsEvenly convex hull

Mathematics Subject Classification ID

Convex programming (90C25) Linear programming (90C05)

Related Items (17)

A comparison of alternative c-conjugate dual problems in infinite convex optimization ⋮ Set-valued evenly convex functions: characterizations and C-conjugacy ⋮ On finite linear systems containing strict inequalities ⋮ On subdifferentials via a generalized conjugation scheme: an application to DC problems and optimality conditions ⋮ Infimal convolution, \( c \)-subdifferentiability, and Fenchel duality in evenly convex optimization ⋮ 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 ⋮ Evenly convex sets, and evenly quasiconvex functions, revisited ⋮ Duality for sets of strong Slater points ⋮ New duality results for evenly convex optimization problems ⋮ Set containment characterization with strict and weak quasiconvex inequalities ⋮ Dual characterizations of set containments with strict convex inequalities ⋮ \(e^{\prime }\)-convex sets and functions: properties and characterizations ⋮ Set containment characterization for quasiconvex programming ⋮ Even convexity, subdifferentiability, and {\(\Gamma\)}-regularization in general topological vector spaces ⋮ Lagrange duality for evenly convex optimization problems ⋮ Duality for closed convex functions and evenly convex functions

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

This page was built for publication: Analyzing linear systems containing strict inequalities via evenly convex hulls