LEKSIKOGRAFIK GEOMETRİK PROGRAMLAMA (LGP)

Authors : Mikulas LUPTACİK, Frantisek TURNOVEC
Pages : 153-156
Doi:10.14783/maruoneri.713024
View : 19 | Download : 13
Publication Date : 1996-01-10
Article Type : Other Papers
Abstract :The paper presents the Kuhn-Tucker conditions and duality theory for the lexicographic minimization problem: iex m in{F insert ignore into journalissuearticles values(x);|x e R n,G insert ignore into journalissuearticles values(x ); < O mj where F and G are vector valued functions form R„ -~*RS and Rn —>Rm , respectively. The lexicographic duality is then applied for problems with polynomials in the objectives and in the constraints.
Keywords : Leksikografi, Geometri, Programlama

ORIGINAL ARTICLE URL
VIEW PAPER (PDF)