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

descriptionPublicationkeyboard_double_arrow_right Article 01 Jun 1999 English Publisher:Springer Science and Business Media LLCJournal:OPSEARCH, volume 36, pages 181-184 (issn: 0030-3887, eissn: 0975-0320,

Copyright policy )

Authors: Kumar, A.;

doi: 10.1007/bf03398573

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

- Summary
- Subjects
- Metrics

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.

Keywords

Nonconvex programming, global optimization

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	0
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Average
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Average
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average

Found an issue? Give us feedback

0

Average

Fields of Science

Fields of Science

Upload OA version

Are you the author of this publication? Upload your Open Access version to Zenodo!

It’s fast and easy, just two clicks!

uploadUpload now