Skip to main content

Post-Optimal Analysis of Linear Semi-Infinite Programs

  • Chapter
  • First Online:
Optimization and Optimal Control

Part of the book series: Springer Optimization and Its Applications ((SOIA,volume 39))

Summary

Linear semi-infinite programming (LSIP) deals with linear optimization problems in which either the dimension of the decision space or the number of constraints (but not both) is infinite. In most applications of LSIP to statistics, electronics, telecommunications, and other fields, all the data (or at least part of them) are uncertain. Post-optimal analysis provides answer to questions about the quantitative impact on the optimal value of small perturbations of the data (sensitivity analysis) and also about the continuity properties of the optimal value, the optimal set, and the feasible set (stability analysis) around the nominal problem. This chapter surveys the state of the art in sensitivity and stability analysis in LSIP.

This work was supported by MICINN of Spain, Grant MTM2008-06695- C03-01.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 219.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Amaya, J., Bosch, P., Goberna, M.A.: Stability of the feasible set mapping of linear systems with an exact constraint set. Set-Valued Anal. 16, 621–635 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  2. Amaya, J., Goberna, M.A.: Stability of the feasible set of linear systems with an exact constraints set. Math. Methods Oper. Res. 63, 107–121 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  3. Bennett, K.P., Parrado-Hernández, E.: The interplay of optimization and machine learning research. J. Mach. Learn. Res. 7, 1265–1281 (2006)

    MathSciNet  MATH  Google Scholar 

  4. Ben-Tal, A., Goryashko, A., Guslitzer, E., Nemirovski, A.: Adjustable robust solutions of uncertain linear programs. Math. Program. 99A, 351–376 (2004)

    Article  MathSciNet  Google Scholar 

  5. Ben-Tal, A., Nemirovski, A.: Robust optimization – methodology and applications. Math. Program. 92B, 453–480 (2002)

    Article  MathSciNet  Google Scholar 

  6. Betró, B.: An accelerated central cutting plane algorithm for linear semi-infinite programming. Math. Program. 101A, 479–495 (2004)

    Article  Google Scholar 

  7. Bonnans, J.F., Shapiro, A.: Perturbation Analysis of Optimization Problems, Springer, NY (2000)

    Google Scholar 

  8. Brosowski, B.: Parametric Semi-Infinite Optimization, Verlag Peter Lang, Frankfurt am Main - Bern (1982)

    Google Scholar 

  9. Campi, M.C., Garatti, S.: The exact feasibility of randomized solutions of uncertain convex programs. SIAM J. Optim. 19, 1211–1230 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  10. .Cánovas, M.J., Dontchev, A.L., López, M.A., Parra, J.: Metric regularity of semi-infinite constraint systems. Math. Program. 104B, 329–346 (2005)

    Article  Google Scholar 

  11. Cánovas, M.J., Gómez-Senent, F.J., Parra, J.: Stability of systems of linear equations and inequalities: distance to ill-posedness and metric regularity. Optimization 56, 1–24 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  12. Cánovas, M.J., Gómez-Senent, F.J., Parra, J.: On the Lipschitz modulus of the argmin mapping in linear semi-infinite optimization. Set-Valued Anal. 16, 511–538 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  13. Cánovas, M.J., Hantoute, A., López, M.A., Parra, J.: Lipschitz behavior of convex semi-infinite optimization problems: a variational approach. J. Global Optim. 41, 1–13 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  14. Cánovas, M.J., Hantoute, A., López, M.A., Parra, J.: Lipschitz modulus of the optimal set mapping in convex optimization via minimal subproblems. Paci. J. Optim. 4, 411–422 (2008)

    MATH  Google Scholar 

  15. Cánovas, M.J., Hantoute, A., López, M.A., Parra, J.: Lipschitz modulus in convex semi-infinite optimization via d.c. functions. ESAIM Control, Optim. Cal. Var. (to appear)

    Google Scholar 

  16. Cánovas, M.J., Hantoute, A., López, M.A., Parra, J.: Stability of indices in KKT conditions and metric regularity in convex semi-infinite optimization. J. Optim. Theory Appl. 139, 485–500 (2008)

    Article  MathSciNet  Google Scholar 

  17. Cánovas, M.J., Klatte, D., López, M.A., Parra, J.: Metric regularity in convex semi-infinite optimization under canonical perturbations, SIAM J. Optim. 18, 717–732 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  18. Cánovas, M.J., López, M.A., Parra, J.: Upper semicontinuity of the feasible set mapping for linear inequality systems. Set-Valued Anal. 10, 361–378 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  19. Cánovas, M.J., López, M.A., Parra, J.: Stability of linear inequality systems in a parametric setting. J. Optim. Theory Appl. 125, 275–297 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  20. Cánovas, M.J., López, M.A., Parra, J.: On the continuity of the optimal value in parametric linear optimization. Stable discretization of the Lagrangian dual of nonlinear problems. Set-Valued Anal. 13, 69–84 (2005)

    MATH  Google Scholar 

  21. Cánovas, M.J., López, M.A., Parra, J.: On the equivalence of parametric contexts for linear inequality systems. J. Comput. Appl. Math. 217, 448–456 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  22. Cánovas, M.J., López, M.A., Parra, J., Todorov, M.I.: Solving strategies and well-posedness in linearsemi-infinite programming. Ann. Oper. Res. 101, 171–190 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  23. Cánovas, M.J., López, M.A., Parra, J., Toledo, F.J.: Distance to ill-posedness and the consistency value of linear semi-infinite inequality systems. Math. Program. 103A, 95–126 (2005)

    Article  Google Scholar 

  24. Cánovas, M.J., López, M.A., Parra, J., Toledo, F.J.: Distance to solvability/unsolvability in linear optimization. SIAM J. Optim. 16, 629–649 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  25. Cánovas, M.J., López, M.A., Parra, J., Toledo, F.J.: Lipschitz continuity of the optimal value via bounds on the optimal set in linear semi-infinite optimization. Math. Oper. Res. 31, 478–489 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  26. Cánovas, M.J., López, M.A., Parra, J., Toledo, F.J.: Ill-posedness with respect to the solvability in linear optimization. Linear Algebra Appl. 416, 520–540 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  27. Cánovas, M.J., López, M.A., Parra, J., Toledo, F.J.: Distance to ill-posedness in linear optimization via the Fenchel-Legendre conjugate. J. Optim. Theory Appl. 130, 173–183 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  28. Cánovas, M.J., López, M.A., Parra, J., Toledo, F.J.: Sufficient conditions for total ill-posedness in linear semi-infinite optimization. Eur. J. Oper. Res. 181, 1126–1136 (2007)

    Article  MATH  Google Scholar 

  29. Cánovas, M.J., López, M.A., Parra, J., Toledo, F.J.: Error bounds for the inverse feasible set mapping in linear semi-infinite optimization via a sensitivity dual approach.Optimization 56, 547–563 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  30. Charnes, A., Cooper, W.W. , Kortanek, K.O.: Duality, Haar programs, and finite sequence spaces. Proc. Natl. Acad. Sci. USA 48, 783–786 (1962)

    Article  MathSciNet  MATH  Google Scholar 

  31. Charnes, A., Cooper, W.W. , Kortanek, K.O.: Duality in semi-infinite programs and some works of Haar and Carathéodory. Manage. Sci. 9, 209–228 (1963)

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  33. Coelho, C.J., Galvao, R.K.H. , de Araujo, M.C.U., Pimentel, M.F., da Silva, E.C.: A linear semi-infinite programming strategy for constructing optimal wavelet transforms in multivariate calibration problems, J. Chem. Inf. Comput. Sci. 43, 928–933 (2003)

    Article  Google Scholar 

  34. Dinh, N., Goberna, M.A., López, M.A.: On the stability of the feasible set in optimization problems. Technical. Report, Department of Statistics and Operational Research, University of Alicante, Spain (2009)

    Google Scholar 

  35. Dinh, N., Goberna, M.A., López, M.A., Son, T.Q.: New Farkas-type constraint qualifications in convex infinite programming. ESAIM Control, Optim. Calc. Var. 13, 580–597 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  36. Dolgin, Y., Zeheb, E.: Model reduction of uncertain FIR discrete-time systems. IEEE Trans. Circuits Syst. 51, 406–411 (2004)

    Google Scholar 

  37. Dolgin, Y., Zeheb, E.: Model reduction of uncertain systems retaining the uncertainty structure. Syst. Control Lett. 54, 771–779 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  38. Epelman, M., Freund, R.M.: A new condition measure, preconditioners, and relations between different measures of conditioning for conic linear systems. SIAM J. Optim. 12, 627–655 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  39. Fang, S.C., Wu, S.Y., Sun, J.: An analytic center based cutting plane method for solving semi-infinite variational inequality problems. J. Global Optim. 24, 141–152 (2004)

    Article  MathSciNet  Google Scholar 

  40. Feyzioglu, O., Altinel, I.K., Ozekici, S.: The design of optimum component test plans for system reliability. Comput. Stat. Data Anal. 50, 3099–3112 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  41. .Fischer, T.: Contributions to semi-infinite linear optimization. Meth. Verf. Math. Phys. 27, 175–199 (1983)

    Google Scholar 

  42. Gauvin, J.: Formulae for the Sensitivity Analysis of Linear Programming Problems. In: M. Lassonde (Ed.), Approximation, Optimization and Mathematical Economics (pp.117–120). Physica Verlag, Berlin (2001)

    Chapter  Google Scholar 

  43. Goberna, M.A., Gómez, 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  MATH  Google Scholar 

  44. Goberna, M.A., Jeyakumar, V., Dinh, N.: Dual characterizations of set containments with strict inequalities. J. Global Optim. 34, 33–54 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  45. Goberna, M.A., Larriqueta, M., Vera de Serio, V.N.: On the stability of the boundary of the feasible set in linear optimization. Set-Valued Anal. 11, 203–223 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  46. Goberna, M.A., Larriqueta, M., Vera de Serio, V.N.: On the stability of the extreme point set in linear optimization. SIAM J. Optim. 15, 1155–1169 (2005)

    MathSciNet  MATH  Google Scholar 

  47. Goberna, M.A., Larriqueta, M., Vera de Serio, V.N.: Stability of the intersection of solution sets of semi-infinite systems, J. Comput. Appl. Math. 217, 420–431 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  48. Goberna, M.A., López, M.A.: Optimal value function in semi-infinite programming. J. Optim. Theory Appl. 59, 261–280 (1988)

    MathSciNet  MATH  Google Scholar 

  49. Goberna, M.A., López, M.A.: Topological stability of linear semi-infinite inequality systems. J. Optim. Theory Appl. 89, 227–236 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  50. Goberna, M.A., López, M.A.: Linear Semi-Infinite Optimization, Wiley, Chichester, England (1998)

    Google Scholar 

  51. Goberna, M.A., López, M.A., Todorov, M.I.: Stability theory for linear inequality systems. SIAM J. Matrix Anal. Appl. 17, 730–743 (1996)

    Article  MATH  Google Scholar 

  52. Goberna, M.A., López, M.A., Todorov, M.I.: Stability theory for linear inequality systems. II: upper semicontinuity of the solution set mapping. SIAM J. Optim. 7, 1138–1151 (1997)

    MATH  Google Scholar 

  53. Goberna, M.A., López, M.A., Todorov, M.I.: On the stability of the feasible set in linear optimization. Set-Valued Anal. 9, 75–99 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  54. Goberna, M.A., López, M.A., Todorov, M.I.: A generic result in linear semi-infinite optimization. Appl. Math. Optim. 48, 181–19 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  55. Goberna, M.A., López, M.A., Todorov, M.I.: On the stability of closed-convex-valued mappings and the associated boundaries. J. Math. Anal. Appl. 306, 502–515 (2005)

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  57. Goberna, M.A., Todorov, M.I.: Primal, dual and primal-dual partitions in continuous linear optimization. Optimization 56, 617–628 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  58. Goberna, M.A., Todorov, M.I.: Ill-posedness in continuous linear optimization via partitions of the space of parameters. Com. Ren. Acad. Bulgare Sci. 60, 357–364 (2007)

    MathSciNet  MATH  Google Scholar 

  59. Goberna, M.A., Todorov, M.I.: Primal-dual stability in continuous linear optimization. Math. Program. 116B, 129–146 (2009)

    Article  MathSciNet  Google Scholar 

  60. Goberna, M.A., Todorov, M.I.: Generic primal-dual solvability in continuous linear semi-infinite programming. Optimization 57 1–10 (2008)

    Article  MathSciNet  Google Scholar 

  61. Goberna, M.A., Todorov, M.I., Vera de Serio, V.N.: On stable uniqueness in linear semi-infinite programming, Technical. Report, Department of Statistics and operational Research, University of Alicante, Spain (2009)

    Google Scholar 

  62. Goberna, M.A., Vera de Serio, V.N.: On the stable containment of two sets. J. Global Optim. 41, 613–624 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  63. Gómez, J.A., Gómez, W.: Cutting plane algorithms for robust conic convex optimization problems. Optim. Methods Softw. 21, 779–803 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  64. Greenberg, H.J.: The use of the optimal partition in a linear programming solution for postoptimal analysis. Oper. Res. Lett. 15, 179–185 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  65. Gustafson, S.A.: On the computational solution of a class of generalized moment problems. SIAM J. Numer. Anal. 7, 343–357 (1970)

    Article  MathSciNet  MATH  Google Scholar 

  66. Gustafson, S.A.: On semi-infinite programming in numerical analysis. Lect. Notes Control Inf. Sci. 15, 137–153 (1979)

    Article  MathSciNet  Google Scholar 

  67. Gustafson, S.A.: A three-phase algorithm for semi-infinite programs, semi-infinite programming and applications. Lect. Notes Econ. Math. Syst. 215, 136–157 (1983)

    MathSciNet  Google Scholar 

  68. Gustafson, S.A., Kortanek, K.O.: Numerical treatment of a class of semi-infinite programming problems. Nav. Res. Logist. Quart. 20, 477–504 (1973)

    Article  MathSciNet  MATH  Google Scholar 

  69. Hansen, E., Walster, G.W.: Global Optimization Using Interval Analysis (2nd edn), Marcel Dekker, NY (2004)

    Google Scholar 

  70. Hantoute, A., López, M.A.: Characterization of total ill-posedness in linear semi-infinite optimization. J. Comput. Appl. Math. 217, 350–364 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  71. Hu, H.: Perturbation analysis of global error bounds for systems of linear inequalities. Math. Program. 88B, 277–284 (2000)

    Article  Google Scholar 

  72. Huang, G.H., He, L., Zeng, G.M., Lu, H.W.: Identification of optimal urban solid waste flow schemes under impacts of energy prices. Environ. Eng. Sci. 25, 685–696 (2008)

    Article  Google Scholar 

  73. Ito, R., Hirabayashi, R.: Design of FIR filter with discrete coefficients based on semi-infinite linear programming method. Pac. J. Optim. 3, 73–86 (2007)

    MathSciNet  MATH  Google Scholar 

  74. Jeyakumar, V., Ormerod, J., Womersly, R.S.: Knowledge-based semi-definite linear programming classifiers. Optim. Methods Softw. 21, 693–706 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  75. Jia, D., Krogh, B.H., Stursberg, O.: LMI approach to robust model predictive control. J. Optim. Theory Appl. 127, 347–365 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  76. John, F.: Extremum problems with inequalities as subsidiary conditions. In Studies and Essays Presented to R. Courant on his 60th Birthday (pp.187–204), Interscience Publishers, NY (1948)

    Google Scholar 

  77. Jongen, H.Th., Rückmann, J.J.: On stability and deformation in semi-infinite optimization. In: R. Reemtsen, J.J. Rückmann (Eds.), Semi-infinite Programming, Kluwer, Boston, 29–67 (1998)

    Google Scholar 

  78. Jongen, H.Th., Twilt, F., Weber, G.H.: Semi-infinite optimization: structure and stability of the feasible set. J. Optim. Theory Appl. 72, 529–552 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  79. Klatte, D., Henrion, R.: Regularity and stability in nonlinear semi-infinite optimization. In: R. Reemtsen, J.J. Rückmann (Eds.), Semi-infinite Programming, Kluwer, Boston, 69–102 (1998)

    Google Scholar 

  80. Kortanek, K.O.: On the 1962–1972 decade of semi-infinite programming: a subjective view. In: M.A. Goberna, M.A. López (Eds.), Semi-Infinite Programming: Recent Advances. Kluwer, Dordrecht, 3–34 (2001)

    Google Scholar 

  81. Kostyukova, O.I.: An algorithm constructing solutions for a family of linear semi-infinite problems. J. Optim. Theory Appl. 110, 585–609 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  82. Krishnan, K., Mitchel, J.E.: Semi-infinite linear programming approaches to semidefinite programming problems. In: P. Pardalos, (Ed.) Novel Approaches to Hard Discrete Optimization (pp.1210–140), American Mathematical Society, Providence, RI (2003)

    Google Scholar 

  83. Krishnan, K., Mitchel, J.E.: A unifying framework for several cutting plane methods for semidefinite programming. Optim. Methods Softw. 21, 57–74 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  84. Krishnan, K., Mitchel, J.E.: A semidefinite programming based polyhedral cut and price approach for the maxcut problem. Comput. Optim. Appl. 33, 51–71 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  85. León, T., Vercher, E.: Solving a class of fuzzy linear programs by using semi-infinite programming techniques. Fuzzy Sets and Systems, 146, 235–252 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  86. Mangasarian, O.L.: Knowledge-based linear programming. SIAM J. Optim. 12, 375–382 (2004)

    MathSciNet  Google Scholar 

  87. Maruhn, J.H.: Duality in static hedging of barrier options. Optimization 58, 319–333 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  88. Maruhn, J.H., Sachs, E.W.: Robust static super-replication of barrier options in the black Scholes Model. In: A.J. Kurdila, P.M. Pardalos, M. Zabarankin, (Ed.) Robust Optimization-Directed Design (pp.127–143). Springer, NY (2005)

    Google Scholar 

  89. Meer, K.: On a refined analysis of some problems in interval arithmetic using real number complexity theory. Reliab. Comput. 10, 209–225 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  90. Mira, J.A., Mora, G.: Stability of linear inequality systems measured by the Hausdorff metric. Set-Valued Anal. 8, 253–266 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  91. RamÍk, J., Inuiguchi, M. (Ed.): Fuzzy Mathematical Programming, Elsevier, Amsterdam (2000)

    Google Scholar 

  92. Renegar, J.: Linear programming, complexity theory and elementary functional analysis. Math. Program. 70A, 279–351 (1995)

    MathSciNet  Google Scholar 

  93. Robinson, S.M.: Stability theory for systems of inequalities. Part I: Linear systems. SIAM J. Numer. Anal. 12, 754–769 (1975)

    Article  MathSciNet  MATH  Google Scholar 

  94. Shapiro, A., Dentcheva, D., Ruszczyński, A.: Lectures on Stochastic Programming. Modeling and Theory, MPS/SIAM Series on Optimization 9, Philadelphia, PA (2009)

    Google Scholar 

  95. Sonnenburg, S., Rätsch, G., Schäfer, C., Schólkopf, B.: Large scale multiple kernel learning. J. Mach. Learn. Res. 7, 1531–1565 (2006)

    MathSciNet  MATH  Google Scholar 

  96. Todorov, M.I.: Generic existence and uniqueness of the solution set to linear semi-infinite optimization problems. Numer. Funct. Anal. Optim. 8, 541–556 (1985–1986)

    MathSciNet  Google Scholar 

  97. Todorov, M.I.: Uniqueness of the saddle points for most of the Lagrange functions of the linear semi-infinite optimization. Numer. Funct. Anal. Optim. 10, 367–382 (1989)

    Article  MathSciNet  MATH  Google Scholar 

  98. Toledo, F.J., Some results on Lipschitz properties of the optimal values in semi-infinite programming. Optim. Meth. Softw. 23, 811–820 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  99. Tuan, H.D., Nam, L.H., Tuy, H., Nguyen, T.Q.: Multicriterion optimized QMF bank design. IEEE Trans. Signal Proces. 51, 2582–2591 (2003)

    Article  Google Scholar 

  100. Vaz, A.I.F., Ferreira, E.C.: Air pollution control with semi-infinite programming. Appl. Math. Modelling 33, 1957–1969 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  101. Venkataramani, R., Bresler, Y.: Filter design for MIMO sampling and reconstruction. IEEE Trans. Signal Proces. 51, 3164–3176 (2003)

    Article  MathSciNet  Google Scholar 

  102. Yu, Y.J., Zhao, G., Teo, K.L., Lim, Y.C.: Optimization of extrapolated impulse response filters using semi-infinite programming, In Control, Communications and Signal Processing, First International Symposium, 397–400 (2004)

    Google Scholar 

  103. Zhu, L.M., Ding, Y., Ding, H.: Algorithm for spatial straightness evaluation using theories of linear complex Chebyshev approximation and semi-infinite linear programming. J. Manufact. Sci. Eng.- Trans. of the ASME 128, 167–174 (2006)

    Article  Google Scholar 

Download references

Acknowledgment

The author wishes to thank M.J. Cánovas, M.D. Fajardo, and J. Parra for their valuable comments and suggestions.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to M.A. Goberna .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer Science+Business Media, LLC

About this chapter

Cite this chapter

Goberna, M. (2010). Post-Optimal Analysis of Linear Semi-Infinite Programs. In: Chinchuluun, ., Pardalos, P., Enkhbat, R., Tseveendorj, I. (eds) Optimization and Optimal Control. Springer Optimization and Its Applications(), vol 39. Springer, New York, NY. https://doi.org/10.1007/978-0-387-89496-6_2

Download citation

Publish with us

Policies and ethics