✨
Yapay Zeka Hızlı Bakış & Çıkarımlar
AI Insight⚡ TL;DR(1 Cümlede Hızlı Çıkarım)
The lexicographic duality is then applied for problems with polynomials in the objectives and in the constraints.
📌 3 Maddede Bu Makale
🎯
Amaç & Hipotez: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.
📊
Temel Bulgular & Veri: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.
💡
Sonuç & Katkı:The lexicographic duality is then applied for problems with polynomials in the objectives and in the constraints.
🔬Tür:Çeviri
📍Kapsam:Genişletilmiş Akademik Örneklem
⚙️Değişkenler:Leksikografi · Geometri · Programlama
Ö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.
Anahtar kelimeler
🔖
Bu Makaleye Atıf Yap
Luptacik, M., Turnovec, F. (1996). LEKSIKOGRAFIK GEOMETRİK PROGRAMLAMA (LGP). Öneri Dergisi, Cilt: 1 Sayı: 4, 153–156. https://doi.org/10.14783/maruoneri.713024