Optimality conditions and duality for interval-valued optimization problems using convexifactors (Q276276): Difference between revisions

@@ Property / Mathematics Subject Classification ID @@
+C26
@@ Property / Mathematics Subject Classification ID: 90C26 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C30
@@ Property / Mathematics Subject Classification ID: 90C30 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C46
@@ Property / Mathematics Subject Classification ID: 90C46 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6576644
@@ Property / zbMATH DE Number: 6576644 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+convexifactors
@@ Property / zbMATH Keywords: convexifactors / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+interval-valued programming
@@ Property / zbMATH Keywords: interval-valued programming / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+convexity
@@ Property / zbMATH Keywords: convexity / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+LU-optimal
@@ Property / zbMATH Keywords: LU-optimal / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+sufficiency
@@ Property / zbMATH Keywords: sufficiency / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+duality
@@ Property / zbMATH Keywords: duality / rank @@
+Normal rank

Revision as of 17:34, 27 June 2023