{"schema_version":"ocme-public-explorer-results-v1","locale":"zh-Hant","filters":{"q":"q-20261013-advance-20261025-r03-convex-optimization-problem-0032"},"total":1,"page":1,"page_count":1,"question_state":"candidate","english_state":"ai_candidate","canonical_truth_promotion":false,"entries":[{"question_id":"q-20261013-advance-20261025-r03-convex-optimization-problem-0032","number":11907,"title":{"zh-Hant":"第 11907 題：凸最佳化問題","en":"Question 11907: Feasibility Alone Supplies No Optimum"},"family_id":"qf-mod25-convexopt-feasible-point-audit","batch_id":"batch-20261013-advance-20261025-r03-convex-optimization-problem-foundations","mko_ids":["mko-convex-optimization-problem"],"question_state":"candidate","english_state":"ai_candidate","processing_state":"second_context_reviewed","source_question_sha256":"3bc079fdf3cb8633756f2984ccbe444de1ff9ccf3566fcfd45912bef6045f6e4","derivation_sha256":"8f8871a9620a905c17a8466a140cb85f1cd69a045ffbcce4dde22ba37dd32330"}]}