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