Add to ORKGSemi-infinite programs will be solved by bisections within the framework of LPs. No gradient information is needed, contrary to the usual Newton-Raphson type methods for solving semi-infinite programs. The rate of convergence is linear. The method has a stable convergence feature derived from the bisection rule.departmental bulletin pape
Fourier-Motzkin elimination is a projection algorithm for solving finite linear programs. We extend ...
The discretization approach for solving semi-infinite optimization problems is considered. We are i...
We consider methods for the solution of large linear optimization problems, in particular so-called ...
Semi-infinite programs will be solved by bisections within the framework of LPs. No gradient informa...
Semi-infinite programs as related to DEA with infinitely many DMUs will be solved by bisections with...
One of the major computational tasks of using the traditional cutting plane approach to solve linear...
International audienceWe focus on convex semi-infinite programs with an infinite number of quadratic...
We focus on convex semi-infinite programs with an infinite number of quadratically parametrized cons...
AbstractThis paper discusses a class of linear semi-infinite programming problems with finite number...
We consider the problem of approximating an optimal solution to a separable, doubly infinite mathema...
This article presents an algorithm that finds an e-feasible solution relatively to some constraints ...
Semi-infinite programming problems can be efficiently solved by reduction type methods. Here, we pre...
The problem (LFP) of finding a feasible solution to a given linear semi-infinite system arises in di...
This article presents an algorithm that finds an e-feasible solution relatively to some constraints ...
AbstractLinear semi-infinite programming deals with the optimization of linear functionals on finite...
Fourier-Motzkin elimination is a projection algorithm for solving finite linear programs. We extend ...
The discretization approach for solving semi-infinite optimization problems is considered. We are i...
We consider methods for the solution of large linear optimization problems, in particular so-called ...
Semi-infinite programs will be solved by bisections within the framework of LPs. No gradient informa...
Semi-infinite programs as related to DEA with infinitely many DMUs will be solved by bisections with...
One of the major computational tasks of using the traditional cutting plane approach to solve linear...
International audienceWe focus on convex semi-infinite programs with an infinite number of quadratic...
We focus on convex semi-infinite programs with an infinite number of quadratically parametrized cons...
AbstractThis paper discusses a class of linear semi-infinite programming problems with finite number...
We consider the problem of approximating an optimal solution to a separable, doubly infinite mathema...
This article presents an algorithm that finds an e-feasible solution relatively to some constraints ...
Semi-infinite programming problems can be efficiently solved by reduction type methods. Here, we pre...
The problem (LFP) of finding a feasible solution to a given linear semi-infinite system arises in di...
This article presents an algorithm that finds an e-feasible solution relatively to some constraints ...
AbstractLinear semi-infinite programming deals with the optimization of linear functionals on finite...
Fourier-Motzkin elimination is a projection algorithm for solving finite linear programs. We extend ...
The discretization approach for solving semi-infinite optimization problems is considered. We are i...
We consider methods for the solution of large linear optimization problems, in particular so-called ...