Skip to main content
Log in

Lagrange Multiplier Characterizations of Solution Sets of Constrained Nonsmooth Pseudolinear Optimization Problems

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

Abstract

This paper deals with the minimization of a class of nonsmooth pseudolinear functions over a closed and convex set subject to linear inequality constraints. We establish several Lagrange multiplier characterizations of the solution set of the minimization problem by using the properties of locally Lipschitz pseudolinear functions. We also consider a constrained nonsmooth vector pseudolinear optimization problem and derive certain conditions, under which an efficient solution becomes a properly efficient solution. The results presented in this paper are more general than those existing in the literature.

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.

Fig. 1

Similar content being viewed by others

References

  1. Mangasarian, O.L.: A simple characterization of solution sets of convex programs. Oper. Res. Lett. 7, 21–26 (1988)

    Article  MATH  MathSciNet  Google Scholar 

  2. Jeyakumar, V., Wolkowicz, H.: Generalizations of Slater’s constraint qualification for infinite convex programs. Math. Program. 57, 551–571 (1992)

    Article  MathSciNet  Google Scholar 

  3. Jeyakumar, V.: Infinite dimensional convex programming with applications to constrained approximation. J. Optim. Theory Appl. 75(3), 469–486 (1992)

    Article  MathSciNet  Google Scholar 

  4. Burke, J.V., Ferris, M.C.: Characterization of solution sets of convex programs. Oper. Res. Lett. 10, 57–60 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  5. Jeyakumar, V., Yang, X.Q.: Convex composite multiobjective nonsmooth programming. Math. Program. 59, 325–343 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  6. Jeyakumar, V., Yang, X.Q.: On characterizing the solution sets of pseudolinear programs. J. Optim. Theory Appl. 87, 747–755 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  7. Penot, J.P.: Characterization of solution sets of quasiconvex programs. J. Optim. Theory Appl. 117(3), 627–636 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  8. Jeyakumar, V., Lee, G.M., Dinh, N.: Lagrange multiplier conditions characterizing optimal solution sets of cone-constrained convex programs. J. Optim. Theory Appl. 123, 83–103 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  9. Jeyakumar, V., Lee, G.M., Dinh, N.: Characterization of solution sets of convex vector minimization problems. Eur. J. Oper. Res. 174, 1380–1395 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  10. Mangasarian, O.L.: Nonlinear Programming. McGraw-Hill, New York (1969)

    MATH  Google Scholar 

  11. Kortanek, K.O., Evans, J.P.: Pseudoconcave programming and Lagrange regularity. Oper. Res. 15, 882–891 (1967)

    Article  MATH  MathSciNet  Google Scholar 

  12. Chew, K.L., Choo, E.U.: Pseudolinearity and efficiency. Math. Program. 28, 226–239 (1984)

    Article  MATH  MathSciNet  Google Scholar 

  13. Komlosi, S.: First and second-order characterizations of pseudolinear functions. Eur. J. Oper. Res. 67, 278–286 (1993)

    Article  MATH  Google Scholar 

  14. Rapscsak, T.: On pseudolinear functions. Eur. J. Oper. Res. 50, 353–360 (1991)

    Article  Google Scholar 

  15. Lu, Q.H., Zhu, D.L.: Some characterizations of locally Lipschitz pseudolinear functions. Math. Appl. 18, 272–278 (2005)

    MATH  MathSciNet  Google Scholar 

  16. Dinh, N., Jeyakumar, V., Lee, G.M.: Lagrange multiplier characterizations of solution sets of constrained pseudolinear optimization problems. Optimization 55(3), 241–250 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  17. Mishra, S.K., Giorgi, G.: Invexity and Optimization. Springer, Berlin (2008)

    Book  MATH  Google Scholar 

  18. Mishra, S.K., Upadhyay, B.B.: Duality in nonsmooth multiobjective programming involving η-pseudolinear functions. Indian J. Indust. Appl. Math. (accepted 2010)

  19. Mishra, S.K., Upadhyay, B.B.: Efficiency and duality in nonsmooth multiobjective fractional programming involving η-pseudolinear functions. Yugosl. J. Oper. Res. 22(1), 3–18 (2012)

    Article  MATH  MathSciNet  Google Scholar 

  20. Clarke, F.H.: Optimization and Nonsmooth Analysis. John Wiley and Sons, New York (1983)

    MATH  Google Scholar 

  21. Aussel, D.: Subdifferential properties of quasiconvex and pseudoconvex functions: unified approach. J. Optim. Theory Appl. 97, 29–45 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  22. Zhao, K.Q., Tang, L.P.: On characterizing solution set of non-differentiable η-pseudolinear extremum problem. Optimization 61(3), 239–249 (2012)

    Article  MATH  MathSciNet  Google Scholar 

  23. Rockafellar, R.T.: Convex Analysis. Princeton University Press, Princeton (1970)

    MATH  Google Scholar 

  24. Geoffrion, A.M.: Proper efficiency and the theory of vector maximization. J. Math. Anal. Appl. 22, 618–630 (1968)

    Article  MATH  MathSciNet  Google Scholar 

  25. Yang, X.Q.: Vector variational inequality and vector pseudolinear optimization. J. Optim. Theory Appl. 95(3), 729–734 (1997)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Acknowledgements

The authors are grateful to the anonymous referees for their valuable suggestions that helped to improve the paper in its present form. The authors would like to thank Prof. Nicolas Hadjisavvas, for fruitful discussions. The second author is supported by the Council of Scientific and Industrial Research, New Delhi, India, through grant no. 09/013(0357)/2011-EMR-I.s.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to S. K. Mishra.

Additional information

Communicated by Vaithilingam Jeyakumar.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Mishra, S.K., Upadhyay, B.B. & An, L.T.H. Lagrange Multiplier Characterizations of Solution Sets of Constrained Nonsmooth Pseudolinear Optimization Problems. J Optim Theory Appl 160, 763–777 (2014). https://doi.org/10.1007/s10957-013-0313-9

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10957-013-0313-9

Keywords

Navigation