Skip to main content
Log in

Strong Duality and Dual Pricing Properties in Semi-Infinite Linear Programming: A non-Fourier–Motzkin Elimination Approach

  • Published:
Journal of Optimization Theory and Applications Aims and scope Submit manuscript

Abstract

Following the idea of the conjecture for semi-infinite programming in a paper by Kortanek and Zhang, recently published in Optimization, in this paper we show that the Fourier–Motzkin elimination is not needed in the study of the strong duality and dual pricing properties for semi-infinite programming. We also prove several new results on the strong duality and dual pricing properties. Specifically, we propose a new subspace, under which the strong duality property holds. We give a necessary and sufficient condition for the dual pricing property to hold under this subspace, which is further used to examine the examples presented in the Basu–Martin–Ryan paper.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Basu, A., Martin, K., Ryan, C.T.: Projection: a unified approach to semi-infinite linear programs and duality in convex programming. Math. Oper. Res. 40, 146–170 (2015)

    Article  MathSciNet  MATH  Google Scholar 

  2. Kortanek, K.O., Zhang, Q.: Extending the mixed algebraic-analysis Fourier–Motzkin elimination method for classifying linear semi-infinite programmes. Optimization 65, 1–21 (2015)

    MATH  Google Scholar 

  3. Ben-Israel, A., Charnes, A., Kortanek, K.O.: Duality and asymptotic solvability over cones. Bull. Am. Math. Soc. 75, 318–324 (1969, 1970) Erratum. Bull. Am. Math. Soc 76, 426

  4. Kortanek, K.O.: Classifying convex extremum problems over linear topologies having separation properties. J. Math. Anal. Appl. 46, 725–755 (1974)

    Article  MathSciNet  MATH  Google Scholar 

  5. Ramana, M.V., Tunçel, L., Wolkowicz, H.: Strong duality for semidefinite programming. SIAM J. Optim. 7, 641–662 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  6. Charnes, A., Cooper, W.W., Kortanek, K.: Duality in semi-infinite programs and some works of Haar and Carathodory. Manag. Sci. 9, 209–228 (1963)

    Article  MATH  Google Scholar 

  7. Charnes, A., Cooper, W.W., Kortanek, K.O.: On representations of semi-infinite programs which have no duality gaps. Manag. Sci. 12, 113–121 (1965)

    Article  MathSciNet  MATH  Google Scholar 

  8. Goberna, M.A., Gomez, S., Guerra, F., Todorov, M.I.: Sensitivity analysis in linear semi-infinite programming: perturbing cost and right-hand-side coefficients. Eur. J. Oper. Res. 181, 1069–1085 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  9. Goberna, M.A., López, M.: Post-Optimal Analysis in Linear Semi-Infinite Optimization. Springer, Berlin (2014)

    Book  MATH  Google Scholar 

  10. Goberna, M.A., Terlaky, T., Todorov, M.I.: Sensitivity analysis in linear semi-infinite programming via partitions. Math. Oper. Res. 35, 14–26 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  11. Basu, A., Martin, K., Ryan, C.T.: Strong duality and sensitivity analysis in semi-infinite linear programming. Math. Program. Ser A. 161, 451–485 (2016)

    Article  MathSciNet  MATH  Google Scholar 

  12. Anderson, E.J., Nash, P.: Linear Programming in Infinite-Dimensional Spaces: Theory and Applications. Wiley, Hoboken (1987)

    MATH  Google Scholar 

  13. Hettich, R., Kortanek, K.O.: Semi-infinite programming: theory, methods, and applications. SIAM Rev. 35, 380–429 (1993)

    Article  MathSciNet  MATH  Google Scholar 

  14. Giannessi, F.: On the theory of Lagrangian duality. Optim. Lett. 1, 9–20 (2007)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Acknowledgements

I would like to thank an anonymous referee for the useful comments and suggestions.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Qinghong Zhang.

Additional information

Communicated by Vaithilingam Jeyakumar.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Zhang, Q. Strong Duality and Dual Pricing Properties in Semi-Infinite Linear Programming: A non-Fourier–Motzkin Elimination Approach. J Optim Theory Appl 175, 702–717 (2017). https://doi.org/10.1007/s10957-017-1184-2

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10957-017-1184-2

Keywords

Mathematics Subject Classification

Navigation