A primal-dual infeasible-interior-point algorithm for linear semi-infinite programming

R. L. Sheu, S. Y. Wu, S. C. Fang

Research output: Contribution to journalArticlepeer-review

7 Citations (Scopus)

Abstract

In this paper, we design an algorithm for solving linear semi-infinite programming problems by using the recently developed primal-dual infeasible-interior-point method for linear programming. The proposed algorithm enjoys the advantages of having "multiple inexactness" and "warm start" for computational efficiency. A convergence proof is included.

Original languageEnglish
Pages (from-to)7-18
Number of pages12
JournalComputers and Mathematics with Applications
Volume29
Issue number8
DOIs
Publication statusPublished - 1995 Apr

All Science Journal Classification (ASJC) codes

  • Modelling and Simulation
  • Computational Theory and Mathematics
  • Computational Mathematics

Fingerprint

Dive into the research topics of 'A primal-dual infeasible-interior-point algorithm for linear semi-infinite programming'. Together they form a unique fingerprint.

Cite this