AbstractIn this paper, we implement an extended version of the inexact approach proposed by Fang and Wu (1994) for solving linear semi-infinite programming problems. Some interesting numerical results are reported. The results confirm that the inexact approach is indeed more efficient and more robust than the exact approach
In this paper we present some semismooth Newton methods for solving the semi-infinite programming pr...
This paper provides a review of numerical methods for the solution of smooth semiinfinite programmin...
Potential Function Methods For Approximately Solving Linear Programming Problems breaks new ground i...
AbstractIn this paper, we implement an extended version of the inexact approach proposed by Fang and...
AbstractIn this paper, we design an algorithm for solving linear semi-infinite programming problems ...
AbstractThis paper discusses a class of linear semi-infinite programming problems with finite number...
We present a primal method for the solution of the semi-infinite linear programming problem with con...
In this paper, we present a new method to solve linear semi-infinite programming. This method bases ...
The aim of this work is to give an overview of methods for solving linear semi-infinite programming ...
We present basic properties and duality results between inexact and generalized linear progra1ns. ln...
We present basic properties and duality results between inexact and generalized linear progra1ns. ln...
The aim of this work is to give an overview of methods for solving linear semi-infinite programming ...
A semi-infinite programming problem is an optimization problem in which finitely many variables appe...
A semi-infinite programming problem is an optimization problem in which finitely many variables appe...
AbstractBy using the theory of parametric semi-infinite programming, we show that the solution of a ...
In this paper we present some semismooth Newton methods for solving the semi-infinite programming pr...
This paper provides a review of numerical methods for the solution of smooth semiinfinite programmin...
Potential Function Methods For Approximately Solving Linear Programming Problems breaks new ground i...
AbstractIn this paper, we implement an extended version of the inexact approach proposed by Fang and...
AbstractIn this paper, we design an algorithm for solving linear semi-infinite programming problems ...
AbstractThis paper discusses a class of linear semi-infinite programming problems with finite number...
We present a primal method for the solution of the semi-infinite linear programming problem with con...
In this paper, we present a new method to solve linear semi-infinite programming. This method bases ...
The aim of this work is to give an overview of methods for solving linear semi-infinite programming ...
We present basic properties and duality results between inexact and generalized linear progra1ns. ln...
We present basic properties and duality results between inexact and generalized linear progra1ns. ln...
The aim of this work is to give an overview of methods for solving linear semi-infinite programming ...
A semi-infinite programming problem is an optimization problem in which finitely many variables appe...
A semi-infinite programming problem is an optimization problem in which finitely many variables appe...
AbstractBy using the theory of parametric semi-infinite programming, we show that the solution of a ...
In this paper we present some semismooth Newton methods for solving the semi-infinite programming pr...
This paper provides a review of numerical methods for the solution of smooth semiinfinite programmin...
Potential Function Methods For Approximately Solving Linear Programming Problems breaks new ground i...
DOI
Add to ORKG