{"schema_version":"ocme-public-explorer-results-v1","locale":"zh-Hant","filters":{"q":"q-20261013-advance-20261025-r03-convex-optimization-problem-0048"},"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-0048","number":11923,"title":{"zh-Hant":"第 11923 題：凸最佳化問題","en":"Question 11923: 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":"51e8cdbf345be39e3c6f35c09fadab3261779c721c5e53621e651741a1897a6e","derivation_sha256":"a80f1488f446c8877a25ab7a118aae24a56120a6debd9ac9705e3b94492c1c6f"}]}