LEKSIKOGRAFIK GEOMETRİK PROGRAMLAMA (LGP)
Authors : Mikulas LUPTACİK, Frantisek TURNOVEC
Pages : 153-156
Doi:10.14783/maruoneri.713024
View : 9 | Download : 2
Publication Date : 1996-01-10
Article Type : Other
Abstract :The paper presents the Kuhn-Tucker conditions and duality theory for the lexicographic minimization problem: iex m in{F (x)|x e R n,G (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