ON OPTIMALITY AND DUALITY RESULTS OF CONVEX SEMI-INFINITE PROGRAMMING PROBLEMS

Please use this identifier to cite or link to this item: http://localhost:8081/jspui/handle/123456789/21151

Full metadata record

DC Field	Value	Language
dc.contributor.author	Garg, Divyanee	-
dc.date.accessioned	2026-06-15T10:32:34Z	-
dc.date.available	2026-06-15T10:32:34Z	-
dc.date.issued	2022-04	-
dc.identifier.uri	http://localhost:8081/jspui/handle/123456789/21151	-
dc.guide	Gupta, S.K.	en_US
dc.description.abstract	This project report is on the optimality and duality condition for convex semi-infinite programming problem.A semi-infinite program is the prob lem in which, there are infinite number of constraints and finite number of variables. The main results are for the convex semi-infinite program ming problem, whose constrains have uniform mean value property. A comparison between necessary and sufficient condition of optimality with The Fritz John and Kuhn-Tucker conditions is explained for such prob lems. The strong duality relation between primal and dual problem are established.	en_US
dc.language.iso	en	en_US
dc.publisher	IIT Roorkee	en_US
dc.title	ON OPTIMALITY AND DUALITY RESULTS OF CONVEX SEMI-INFINITE PROGRAMMING PROBLEMS	en_US
dc.type	Dissertations	en_US
Appears in Collections:	MASTERS' THESES (Maths)

Files in This Item:

File	Description	Size	Format
20616008_DIVYANEE GARG.pdf		422.97 kB	Adobe PDF	View/Open