Can linear superiorization be useful for linear optimization problems?

Research output: Contribution to journalArticlepeer-review


Linear superiorization (LinSup) considers linear programming problems but instead of attempting to solve them with linear optimization methods it employs perturbation resilient feasibility-seeking algorithms and steers them toward reduced (not necessarily minimal) target function values. The two questions that we set out to explore experimentally are: (i) does LinSup provide a feasible point whose linear target function value is lower than that obtained by running the same feasibility-seeking algorithm without superiorization under identical conditions? (ii) How does LinSup fare in comparison with the Simplex method for solving linear programming problems? Based on our computational experiments presented here, the answers to these two questions are: 'yes' and 'very well', respectively.

Original languageEnglish
Article number044006
JournalInverse Problems
Issue number4
StatePublished - 1 Mar 2017

Bibliographical note

Publisher Copyright:
© 2017 IOP Publishing Ltd.


  • Agmon-Motzkin-Schoenberg algorithm
  • Simplex algorithm
  • bounded perturbation resilience
  • feasibility-seeking
  • linear programming
  • superiorization

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Signal Processing
  • Applied Mathematics
  • Computer Science Applications
  • Mathematical Physics


Dive into the research topics of 'Can linear superiorization be useful for linear optimization problems?'. Together they form a unique fingerprint.

Cite this