LEKSIKOGRAFIK GEOMETRİK PROGRAMLAMA (LGP)

Özet

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.