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