An interior point algorithm for semi-infinite linear programming

1989 ◽  
Vol 43 (1-3) ◽  
pp. 257-276 ◽  
Author(s):  
M. C. Ferris ◽  
A. B. Philpott
Keyword(s):  
Linear Programming ◽  
Interior Point ◽  
Interior Point Algorithm ◽  
Infinite Linear Programming ◽  
Infinite Linear

Duality for inexact semi-infinite linear programming

Optimization ◽  
2005 ◽  
Vol 54 (1) ◽  
pp. 1-25 ◽  
Author(s):  
Juan A. Gómez † ◽  
Paul J. Bosch ‡ ◽  
Jorge Amaya
Keyword(s):  
Linear Programming ◽  
Infinite Linear Programming ◽  
Infinite Linear

Algorithm for Spatial Straightness Evaluation Using Theories of Linear Complex Chebyshev Approximation and Semi-infinite Linear Programming

2005 ◽  
Vol 128 (1) ◽  
pp. 167-174 ◽  
Author(s):  
LiMin Zhu ◽  
Ye Ding ◽  
Han Ding
Keyword(s):  
Linear Programming ◽  
Chebyshev Approximation ◽  
Approximation Problem ◽  
Linear Complex ◽  
Infinite Linear Programming ◽  
Minimum Zone ◽  
Effectiveness And Efficiency ◽  
Primal And Dual ◽  
Straightness Error ◽  
Infinite Linear

This paper presents a novel methodology for evaluating spatial straightness error based on the minimum zone criterion. Spatial straightness evaluation is formulated as a linear complex Chebyshev approximation problem, and then reformulated as a semi-infinite linear programming problem. Both models for the primal and dual programs are developed. An efficient simplex-based algorithm is employed to solve the dual linear program to yield the straightness value. Also a general algebraic criterion for checking the optimality of the solution is proposed. Numerical experiments are given to verify the effectiveness and efficiency of the presented algorithm.

A note on primal-dual stability in infinite linear programming

2020 ◽  
Vol 14 (8) ◽  
pp. 2247-2263
Author(s):  
Miguel A. Goberna ◽  
Marco A. López ◽  
Andrea B. Ridolfi ◽  
Virginia N. Vera de Serio
Keyword(s):  
Linear Programming ◽  
Infinite Linear Programming ◽  
Primal Dual ◽  
Infinite Linear

A parallel interior point algorithm for linear programming on a network of transputers

1993 ◽  
Vol 43 (2) ◽  
pp. 49-86 ◽  
Author(s):  
R. H. Bisseling ◽  
T. M. Doup ◽  
L. D. J. C. Loyens
Keyword(s):  
Linear Programming ◽  
Interior Point ◽  
Interior Point Algorithm
Sign in / Sign up

Export Citation Format

Share Document