Skip to main content
SpringerLink
Log in

Duality for nonsmooth semi-infinite programming problems

  • Original Paper
  • Published:
Optimization Letters Aims and scope Submit manuscript

Abstract

This paper deals with nonsmooth semi-infinite programming problem which in recent years has become an important field of active research in mathematical programming. A semi-infinite programming problem is characterized by an infinite number of inequality constraints. We formulate Wolfe as well as Mond-Weir type duals for the nonsmooth semi-infinite programming problem and establish weak, strong and strict converse duality theorems relating the problem and the dual problems. To the best of our knowledge such results have not been done till now.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Ansari Q.H., Yao J.C.: On nondifferential and nonconvex vector optimization problems. J. Optim. Theory Appl. 106, 475–488 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  2. Daldoul M., Baccari A.: An application of matrix computations to classical second-order optimality conditions. Optim. Lett. 3(4), 547–557 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  3. Canovas M.J., Lopez M.A., Mordukhovich B.S., Parra J.: Variational analysis in semi-infinite and finite programming, I: Stability of linear inequality systems of feasible solutions. SIAM J. Optim. 20, 1504–1526 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  4. Canovas, M.J., Lopez, M.A., Mordukhovich, B.S., Parra, J.: Variational analysis in semi-infinite and finite programming, II: Necessary optimality conditions (preprint)

  5. Dinh, N., Morukhovich, B.S., Nghia, T.T.A.: Subdifferentials of value functions and optimality conditions for DC and bilevel infinite and semi-infinite programs, Math. Program. Ser B. doi:10.1007/s10107-009-0323-4

  6. Flouda, C.A., Pardalos, P.M. (eds): Encyclopedia of Optimization, 2nd edn. Springer, New York (2009)

    Google Scholar 

  7. Goberna M.A., Lopez M.A.: Linear semi-infinite programming theory: an updated survey. Eur. J. Oper. Res. 143, 390–405 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  8. Gunzel H., Jogen H.Th., Stein O.: Generalized semi-infinite programming: the symmetric reduction ansatz. Optim. Lett. 2(3), 415–424 (2008)

    Article  MathSciNet  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  10. Jeyakumar V.: A note on strong duality in convex semi-definite optimization: necessary and sufficient conditions. Optim. Lett. 2(1), 15–25 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  11. Kanzi N., Nobakhtian S.: Optimality conditions for non-smooth semi-infinite programming. Optimization 59(5), 717–727 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  12. Kanzi N., Nobakhtian S.: Nonsmooth semi-infinite programming problems with mixed constraints. J. Math. Anal. Appl. 351, 170–181 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  13. Lopez M., Still G.: Semi-infinite programming. Eur. J. Oper. Res. 180, 491–518 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  14. Mishra S.K., Wang S.Y., Lai K.K.: On nonsmooth α-invex functions and vector variational-like inequality. Optim. Lett. 2, 91–98 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  15. Mond B., Weir T.: Generalized concavity and duality, Generalized Concavity in Optimization and Economics, pp. 263–279. Academic Press, New York (1981)

    Google Scholar 

  16. Shapiro A.: On duality theory of convex semi-infinite programming. Optimization 54, 535–543 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  17. Shapiro A.: Semi-infinite programming, duality, discretization and optimality condition. Optimization 58(2), 133–161 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  18. Wang Q.L., Li S.J., Teo K.L.: Higher-order optimality conditions for weakly efficient solutions in nonconvex set-valued optimization. Optim. Lett. 4(3), 425–437 (2010)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Banaras Hindu University, Varanasi, India

    S. K. Mishra & M. Jaiswal

  2. Laboratory of Theoretical and Applied Computer Science LITA, UFR MIM, University Paul Verlaine of Metz, Metz, France

    Le Thi Hoai An

Authors
  1. S. K. Mishra
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. M. Jaiswal
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Le Thi Hoai An
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to S. K. Mishra.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Mishra, S.K., Jaiswal, M. & An, L.T.H. Duality for nonsmooth semi-infinite programming problems. Optim Lett 6, 261–271 (2012). https://doi.org/10.1007/s11590-010-0240-8

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11590-010-0240-8

Keywords

Search

Navigation