Add to ORKGThe aim of this work is to give an overview of methods for solving linear semi-infinite programming problems. The work also discusses various types of cutting plane method for sdemi-infinite programming problems. The work involves implementation of two types of this method in programming language Octave and the behavior of these methods is shown on examples
Optimisation problems occur in many branches of science, engineering, and economics, as well as in o...
We analyze the properties of an interior point cutting plane algorithm that is based on a semi-infin...
We consider methods for the solution of large linear optimization problems, in particular so-called ...
The aim of this work is to give an overview of methods for solving linear semi-infinite programming ...
AbstractThe paper starts with a simple model and convergence theorem for outer approximation methods...
Cutting plane methods are an alternative to interior methods to solve semidefinite programming (SDP)...
A semi-infinite programming problem is an optimization problem in which finitely many variables appe...
AbstractIn this paper, we develop two discretization algorithms with a cutting plane scheme for solv...
In this paper, we present a new method to solve linear semi-infinite programming. This method bases ...
AbstractThis paper discusses a class of linear semi-infinite programming problems with finite number...
We present a reduction type algorithm for solving nonlinear semi-infinite programming problems. The ...
AbstractIn this paper, we implement an extended version of the inexact approach proposed by Fang and...
One of the major computational tasks of using the traditional cutting plane approach to solve linear...
This paper provides a review of numerical methods for the solution of smooth semiinfinite programmin...
SIGLEAvailable from TIB Hannover: RR 7760(1998,7) / FIZ - Fachinformationszzentrum Karlsruhe / TIB -...
Optimisation problems occur in many branches of science, engineering, and economics, as well as in o...
We analyze the properties of an interior point cutting plane algorithm that is based on a semi-infin...
We consider methods for the solution of large linear optimization problems, in particular so-called ...
The aim of this work is to give an overview of methods for solving linear semi-infinite programming ...
AbstractThe paper starts with a simple model and convergence theorem for outer approximation methods...
Cutting plane methods are an alternative to interior methods to solve semidefinite programming (SDP)...
A semi-infinite programming problem is an optimization problem in which finitely many variables appe...
AbstractIn this paper, we develop two discretization algorithms with a cutting plane scheme for solv...
In this paper, we present a new method to solve linear semi-infinite programming. This method bases ...
AbstractThis paper discusses a class of linear semi-infinite programming problems with finite number...
We present a reduction type algorithm for solving nonlinear semi-infinite programming problems. The ...
AbstractIn this paper, we implement an extended version of the inexact approach proposed by Fang and...
One of the major computational tasks of using the traditional cutting plane approach to solve linear...
This paper provides a review of numerical methods for the solution of smooth semiinfinite programmin...
SIGLEAvailable from TIB Hannover: RR 7760(1998,7) / FIZ - Fachinformationszzentrum Karlsruhe / TIB -...
Optimisation problems occur in many branches of science, engineering, and economics, as well as in o...
We analyze the properties of an interior point cutting plane algorithm that is based on a semi-infin...
We consider methods for the solution of large linear optimization problems, in particular so-called ...