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