This paper reviews the state-of-the-art in the theory of deterministic and uncertain linear
semi-infinite optimization, presents some numerical approaches to this type of problems …

The book provides a self-contained and systematic treatment of algebraic and topological
properties of convex sets in the n-dimensional Euclidean space. It benefits advanced …

This paper reviews the state-of-the-art in the theory of deterministic and uncertain linear
semi-infinite optimization, presents some numerical approaches to this type of problems …

This is the first book devoted to linear systems of the form: σ={〈 at, x〉≤ bt, t∈ W;〈 at, x〉<
bt, t∈ S}, where〈·,·〉 denotes the standard inner product in Rn, W and S are arbitrary …

The intersection cut paradigm is a powerful framework that facilitates the generation of valid
linear inequalities, or cutting planes, for a potentially complex set S. The key ingredients in …

A set is called Motzkin decomposable when it can be expressed as the Minkowski sum of a
compact convex set with a closed convex cone. The main result in this paper establishes …

We introduce and study the family of sets in a finite dimensional Euclidean space which can
be written as the Minkowski sum of a compact and convex set and a convex cone (not …

A nonempty set F is called Motzkin decomposable when it can be expressed as the
Minkowski sum of a compact convex set C with a closed convex cone D. In that case, the …

Finite-dimensional linear programs satisfy strong duality (SD) and have the “dual
pricing”(DP) property. The DP property ensures that, given a sufficiently small perturbation of …

In this paper the generalized Minkowski sets are defined and characterized. On the other
hand, the Motzkin decomposable sets, along with their epigraphic versions are considered …