Advanced search
Publication Cover
Optimization
A Journal of Mathematical Programming and Operations Research
Volume 65, 2016 - Issue 4
Submit an article Journal homepage
173
Views
2
CrossRef citations to date
0
Altmetric
Articles

Extending the mixed algebraic-analysis Fourier–Motzkin elimination method for classifying linear semi-infinite programmes

K.O. KortanekDepartment of Industrial Engineering, University of Pittsburgh, Pittsburgh, PA, USA.
&
Qinghong ZhangDepartment of Mathematics and Computer Science, Northern Michigan University, Marquette, MI, USA.Correspondence[email protected]
Pages 707-727 | Received 06 Nov 2014, Accepted 16 Jul 2015, Published online: 11 Sep 2015

References

  • Basu A, Martin K, Ryan CT. Projection: a unified approach to semi-infinite linear programs and duality in convex programming. Math. Oper. Res. 2015;40:146–170.
  • Zhang Q. Understanding linear semi-infinite programming via linear programming over cones. Optimization. 2010;59:1247–1258.
  • Duffin RJ. Infinite programs. In: Kuhn HW, Tucker AW, editors. Linear inequalities and related systems. Princeton (NJ): Princeton University Press; 1956. p. 157–170.
  • Luo Z, Sturm JF, ZhangS. Duality results for conic convex programming. Rotterdam: Erasumus University; 1997 (Report no. 9719/A).
  • Ben-Israel A, Charnes A, Kortanek KO. Duality and asymptotic solvability over cones. Bull. Amer. Math. Soc. 1969;75:318–324. Erratum, Bull. Amer. Math. Soc. 1970;76:426.
  • Gustafson S-Å, Kortanek KO, Rom WO. Non-Chebysevian moment problems. SIAM J. Numer. Anal. 1970;7:335–342.
  • Kortanek KO. Classifying convex extremum problems over linear topologies having separation properties. J. Math. Anal. Appl. 1974;46:725–755.
  • Renegar J. Some perturbation theory for linear programming. Math. Program. 1994;65:161–184.
  • Renegar J. Linear programming, complexity theory, and elementary functional analysis. Math. Program. 1995;70:279–351.
  • Nesterov Y, Todd MJ, Ye Y. Infeasible-start primal-dual methods and infeasibility detectors for nonlinear programming problems. Math. Program. 1999;84:227–267.
  • Bonnans JF, Shapiro A. Perturbation analysis of optimization problems. New York (NY): Springer-Verlag; 2000.
  • Kortanek KO. Observations on infeasibility detectors for classifying conic convex programs. Optimization. 2002;51:323–338.
  • Williams HP. Fourier’s method of linear programming and its dual. Amer. Math. Monthly. 1986;93:681–695.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Order Reprints Request Corporate Permissions

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

Request Academic Permissions

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.

Related research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.