In this note we are concerned with the generalization given by Ferris and Philpott [3] of the affine scaling algorithm discovered by Dikin [2] to solve semi-infinite linear programming problems, in which the number of variables is finite, but the number of constraints is not. In [3] a discrepancy is pointed out between the classical algorithm and its generalization. The purpose of this note is ...

A globally convergent algorithm is presented for the solution of a wide class of semi-infinite programming problems. The method is based on the solution of a sequence of equality constrained quadratic programming problems, and usually has a second order convergence rate. Numerical results illustrating the effectiveness of the method are given.

Semi-infinite linear programs often arise as the limit of a sequence of approximating linear programs. Hence, studying the behavior of extensions of linear programming algorithms to semi-infinite problems can yield valuable insight into the behavior of the underlying linear programming algorithm when the number of constraints or the number of variables is very large. In this paper, we study the...

As we are faced with more uncertainty problems in the real world, it is necessary to ‎provide ‎models that can provide appropriate solutions for dealing these issues. In this ‎study, ‎ proposed a new approach solving linear programming problem fuzzy ‎environment ‎based on ‎a related multi-objective model. This kind of be ‎reduced ‎fuzzy semi-infinite problem. way, present ‎mixed ‎Multi-Objectiv...