Skip to main content
SpringerLink
Log in

On Strong Pseudoinvexity in a Programming Problem Containing Lp Norm in the Objective Function

  • Theoretical Papers
  • Published:
OPSEARCH Aims and scope Submit manuscript

Abstract

Sufficient conditions for optimality of Kuhn-Tucker type of a programming problem containing Lp norm in the objective function are obtained under strong pseudoinvexity assumptions. Based upon these conditions duality theorems are also established.

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. BECTOR, C.R. (1968), Mathematical analysis of some nonlinear programming problems, Ph.D. Thesis, LIT., Kanpur.

    Google Scholar 

  2. BEN-ISRAEL, A. and MOND, B. (1986), What is invexity? J. Austral, Math, Soc. Series B, 28, 1–9.

    Article  Google Scholar 

  3. CRAVEN, B.D. and MOND, B. (1979), Lagrangian conditions for quasidifferentiable optimization, Survey of mathematical programming I, A. Prekopa (ed.), 1977–191, North Holland.

    Google Scholar 

  4. MOND, B. And SCHECHTER, M. (1976), A programming problem with an lp norm in the objective function, J. Austral. Math, Soc. Ser. B, 333–342.

    Google Scholar 

  5. MOND, B and WEIR, T (1981), Generalized concavity & duality in; Generalized concavity in optimization & economics, (eds.) S. Schaible & W.T. Ziemba, Academic Press, New York, 263–279.

  6. ROCKAFELLAR, R.T. (1970), Convex analysis, Princeton Univ. Press, Princeton, NJ

    Book  Google Scholar 

  7. WATSON. G.A. (1978), A class of programming problems whose objective function contains a norm, J. Approximation Theo., 23, 401–411.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Regional Engg. College, Rourkela, 769 008, USA

    A. Kumar

Authors
  1. A. Kumar
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Kumar, A. On Strong Pseudoinvexity in a Programming Problem Containing Lp Norm in the Objective Function. OPSEARCH 36, 181–184 (1999). https://doi.org/10.1007/BF03398573

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF03398573

Search

Navigation