AbstractIn this note, it is shown that, for an arbitrary semi-infinite convex program, there exists a countable subcollection of the constraints which gives the primal program and whose dual gives the original dual value
This article provides results guarateeing that the optimal value of a given convex infinite optimiza...
We focus on convex semi-infinite programs with an infinite number of quadratically parametrized cons...
Fourier-Motzkin elimination is a projection algorithm for solving finite linear programs. We extend ...
AbstractIn this note, it is shown that, for an arbitrary semi-infinite convex program, there exists ...
In this article we discuss weak and strong duality properties of convex semi-infinite programming pr...
AbstractIn 1961, Clark proved that if either the feasible region of a linear program or its dual is ...
New results are established for multiobjective DC programs with infinite convex constraints (MOPIC) ...
In two recent papers Chabnes, Gbibie, and Kortanek studied a special class of infinite linear progra...
In this paper, we derive sufficient condition for global optimality for a nonsmooth semi-infinite ma...
Duality is studied for a minimization problem with finitely many inequality and equality constraints...
Abstract Duality is studied for a minimization problem with finitely many in-equality and equality c...
AbstractIn this study we present an important theorem of the alternative involving convex functions ...
AbstractThis paper gives theorems on the boundedness of the feasible and the optimal solutions sets ...
This article considers a semi-infinite mathematical programming problem with equilibrium constraints...
International audienceWe focus on convex semi-infinite programs with an infinite number of quadratic...
This article provides results guarateeing that the optimal value of a given convex infinite optimiza...
We focus on convex semi-infinite programs with an infinite number of quadratically parametrized cons...
Fourier-Motzkin elimination is a projection algorithm for solving finite linear programs. We extend ...
AbstractIn this note, it is shown that, for an arbitrary semi-infinite convex program, there exists ...
In this article we discuss weak and strong duality properties of convex semi-infinite programming pr...
AbstractIn 1961, Clark proved that if either the feasible region of a linear program or its dual is ...
New results are established for multiobjective DC programs with infinite convex constraints (MOPIC) ...
In two recent papers Chabnes, Gbibie, and Kortanek studied a special class of infinite linear progra...
In this paper, we derive sufficient condition for global optimality for a nonsmooth semi-infinite ma...
Duality is studied for a minimization problem with finitely many inequality and equality constraints...
Abstract Duality is studied for a minimization problem with finitely many in-equality and equality c...
AbstractIn this study we present an important theorem of the alternative involving convex functions ...
AbstractThis paper gives theorems on the boundedness of the feasible and the optimal solutions sets ...
This article considers a semi-infinite mathematical programming problem with equilibrium constraints...
International audienceWe focus on convex semi-infinite programs with an infinite number of quadratic...
This article provides results guarateeing that the optimal value of a given convex infinite optimiza...
We focus on convex semi-infinite programs with an infinite number of quadratically parametrized cons...
Fourier-Motzkin elimination is a projection algorithm for solving finite linear programs. We extend ...
DOI
Add to ORKG