{"schema_version":"ocme-public-explorer-results-v1","locale":"zh-Hant","filters":{"family":"qf-app21-lp-finite-optimum"},"total":25,"page":1,"page_count":1,"question_state":"candidate","english_state":"ai_candidate","canonical_truth_promotion":false,"entries":[{"question_id":"q-20261013-advance-20261021-r06-linear-programming-0076","number":2451,"title":{"zh-Hant":"第 2451 題：有限線性規劃候選","en":"Question 2451: All Tied Optimizers among the Explicit Feasible Candidates"},"family_id":"qf-app21-lp-finite-optimum","batch_id":"batch-20261013-advance-20261021-r06-linear-programming-foundations","mko_ids":["mko-linear-programming"],"question_state":"candidate","english_state":"ai_candidate","processing_state":"second_context_reviewed","source_question_sha256":"72951a309add7f2f4c92909329956b2e82e3df02c0de4b67747f369a643841f5","derivation_sha256":"69961a34ae42225c7582e712a6c25c3251593b156b1d29cd334914afae7aa4ac"},{"question_id":"q-20261013-advance-20261021-r06-linear-programming-0077","number":2452,"title":{"zh-Hant":"第 2452 題：有限線性規劃候選","en":"Question 2452: All Tied Optimizers among the Explicit Feasible Candidates"},"family_id":"qf-app21-lp-finite-optimum","batch_id":"batch-20261013-advance-20261021-r06-linear-programming-foundations","mko_ids":["mko-linear-programming"],"question_state":"candidate","english_state":"ai_candidate","processing_state":"second_context_reviewed","source_question_sha256":"19feb86a9da9873fa98a7e1815acc17addcdb9fe5e5a90e3e90d81e608a5dd27","derivation_sha256":"8588a1bdb4058b643ced57d26394f172d6d123056fc1eff720c9e8a08d9d045f"},{"question_id":"q-20261013-advance-20261021-r06-linear-programming-0078","number":2453,"title":{"zh-Hant":"第 2453 題：有限線性規劃候選","en":"Question 2453: All Tied Optimizers among the Explicit Feasible Candidates"},"family_id":"qf-app21-lp-finite-optimum","batch_id":"batch-20261013-advance-20261021-r06-linear-programming-foundations","mko_ids":["mko-linear-programming"],"question_state":"candidate","english_state":"ai_candidate","processing_state":"second_context_reviewed","source_question_sha256":"fe138ef964f38332c3c59b96c963e2aa722caab72df4a09b69305375939b0723","derivation_sha256":"9335e0ac0341cfb1e1495260ac04c2cad55d4a8504cb5ee718edf684efe71176"},{"question_id":"q-20261013-advance-20261021-r06-linear-programming-0079","number":2454,"title":{"zh-Hant":"第 2454 題：有限線性規劃候選","en":"Question 2454: All Tied Optimizers among the Explicit Feasible Candidates"},"family_id":"qf-app21-lp-finite-optimum","batch_id":"batch-20261013-advance-20261021-r06-linear-programming-foundations","mko_ids":["mko-linear-programming"],"question_state":"candidate","english_state":"ai_candidate","processing_state":"second_context_reviewed","source_question_sha256":"d11f5bcfca0a00d70ec54f516c31dc7bd7bbc14b820ae7a5ebef17ea1fc3c083","derivation_sha256":"73eb87e3c7e26f2bf9023b505c3e619175a0f4ebde8e4b0cdcdf95f5874444b2"},{"question_id":"q-20261013-advance-20261021-r06-linear-programming-0080","number":2455,"title":{"zh-Hant":"第 2455 題：有限線性規劃候選","en":"Question 2455: All Tied Optimizers among the Explicit Feasible Candidates"},"family_id":"qf-app21-lp-finite-optimum","batch_id":"batch-20261013-advance-20261021-r06-linear-programming-foundations","mko_ids":["mko-linear-programming"],"question_state":"candidate","english_state":"ai_candidate","processing_state":"second_context_reviewed","source_question_sha256":"d46df97f36f77f4561eead01b6fd0227e11462376c03e8d920cf4cd038097dde","derivation_sha256":"279c93dec5091c27d6c626d6c416b3f23d059881850c441f47f21f007eb34632"},{"question_id":"q-20261013-advance-20261021-r06-linear-programming-0081","number":2456,"title":{"zh-Hant":"第 2456 題：有限線性規劃候選","en":"Question 2456: All Tied Optimizers among the Explicit Feasible Candidates"},"family_id":"qf-app21-lp-finite-optimum","batch_id":"batch-20261013-advance-20261021-r06-linear-programming-foundations","mko_ids":["mko-linear-programming"],"question_state":"candidate","english_state":"ai_candidate","processing_state":"second_context_reviewed","source_question_sha256":"0d3e99884b65bcb9b6adb126cc8b0c80bb7da9b3e5bf6cac74595b3203c4e8fe","derivation_sha256":"727eaa4b8bf3e9c556d5e07cb3017fb067f1de67e27980dec6d42dd911dba310"},{"question_id":"q-20261013-advance-20261021-r06-linear-programming-0082","number":2457,"title":{"zh-Hant":"第 2457 題：有限線性規劃候選","en":"Question 2457: All Tied Optimizers among the Explicit Feasible Candidates"},"family_id":"qf-app21-lp-finite-optimum","batch_id":"batch-20261013-advance-20261021-r06-linear-programming-foundations","mko_ids":["mko-linear-programming"],"question_state":"candidate","english_state":"ai_candidate","processing_state":"second_context_reviewed","source_question_sha256":"7af8b42bea38e7871b462399cd07a076faabfb6832701033e1000f56a2c113fd","derivation_sha256":"bd5145972a83efa3023c5ad3144b109989a37d6b79738cc878a05168ebb3b56d"},{"question_id":"q-20261013-advance-20261021-r06-linear-programming-0083","number":2458,"title":{"zh-Hant":"第 2458 題：有限線性規劃候選","en":"Question 2458: All Tied Optimizers among the Explicit Feasible Candidates"},"family_id":"qf-app21-lp-finite-optimum","batch_id":"batch-20261013-advance-20261021-r06-linear-programming-foundations","mko_ids":["mko-linear-programming"],"question_state":"candidate","english_state":"ai_candidate","processing_state":"second_context_reviewed","source_question_sha256":"018731bcea6dc8e79ef35fccd8391105235580516b73f538591b80e32147214d","derivation_sha256":"3f9b24d4c4829b9b9b90e4dc0da71b856bef13cee95386fa282ab56bf441343f"},{"question_id":"q-20261013-advance-20261021-r06-linear-programming-0084","number":2459,"title":{"zh-Hant":"第 2459 題：有限線性規劃候選","en":"Question 2459: All Tied Optimizers among the Explicit Feasible Candidates"},"family_id":"qf-app21-lp-finite-optimum","batch_id":"batch-20261013-advance-20261021-r06-linear-programming-foundations","mko_ids":["mko-linear-programming"],"question_state":"candidate","english_state":"ai_candidate","processing_state":"second_context_reviewed","source_question_sha256":"e1b43a56046949144ee041fdccb5354f5b908e7d781285e0b363195450bf6281","derivation_sha256":"1f781e9bfb418798064f9743c1f9de2eed7ee3499282ff2a3fb361bb58eb6ce4"},{"question_id":"q-20261013-advance-20261021-r06-linear-programming-0085","number":2460,"title":{"zh-Hant":"第 2460 題：有限線性規劃候選","en":"Question 2460: All Tied Optimizers among the Explicit Feasible Candidates"},"family_id":"qf-app21-lp-finite-optimum","batch_id":"batch-20261013-advance-20261021-r06-linear-programming-foundations","mko_ids":["mko-linear-programming"],"question_state":"candidate","english_state":"ai_candidate","processing_state":"second_context_reviewed","source_question_sha256":"2d419550ca1047b27faf1251ac8a23ffa043cf24ec872e1c23acf27e092c612a","derivation_sha256":"5632f9e8cfc525650be836b40db7d6a33415b6051a4f91bdfffe1de102d4fb05"},{"question_id":"q-20261013-advance-20261021-r06-linear-programming-0086","number":2461,"title":{"zh-Hant":"第 2461 題：有限線性規劃候選","en":"Question 2461: All Tied Optimizers among the Explicit Feasible Candidates"},"family_id":"qf-app21-lp-finite-optimum","batch_id":"batch-20261013-advance-20261021-r06-linear-programming-foundations","mko_ids":["mko-linear-programming"],"question_state":"candidate","english_state":"ai_candidate","processing_state":"second_context_reviewed","source_question_sha256":"7393a4b4faec3af7efe921595be616da783a028136b2c8d5282faa4f8de8e76f","derivation_sha256":"86c16647d4983f357103298c06e045833dfcc632cc44b6b456064dc55a4d4178"},{"question_id":"q-20261013-advance-20261021-r06-linear-programming-0087","number":2462,"title":{"zh-Hant":"第 2462 題：有限線性規劃候選","en":"Question 2462: All Tied Optimizers among the Explicit Feasible Candidates"},"family_id":"qf-app21-lp-finite-optimum","batch_id":"batch-20261013-advance-20261021-r06-linear-programming-foundations","mko_ids":["mko-linear-programming"],"question_state":"candidate","english_state":"ai_candidate","processing_state":"second_context_reviewed","source_question_sha256":"b43a553a8de03d07dca63224110dd3a99acc261e29db22e8078de5520766840d","derivation_sha256":"1b0e839ec44c15cf3d56d0dd896278a729d6ba3b0eaa9ef3b8fe46633babcd99"},{"question_id":"q-20261013-advance-20261021-r06-linear-programming-0088","number":2463,"title":{"zh-Hant":"第 2463 題：有限線性規劃候選","en":"Question 2463: All Tied Optimizers among the Explicit Feasible Candidates"},"family_id":"qf-app21-lp-finite-optimum","batch_id":"batch-20261013-advance-20261021-r06-linear-programming-foundations","mko_ids":["mko-linear-programming"],"question_state":"candidate","english_state":"ai_candidate","processing_state":"second_context_reviewed","source_question_sha256":"80e39953bc78e18ee17b53743ad9e6ef434eb8cd31203f3c149834532d6304f7","derivation_sha256":"25a9226ace2765b9f08f7ae45b847afe8ddfc6da3620d1e3a374e95447396edb"},{"question_id":"q-20261013-advance-20261021-r06-linear-programming-0089","number":2464,"title":{"zh-Hant":"第 2464 題：有限線性規劃候選","en":"Question 2464: All Tied Optimizers among the Explicit Feasible Candidates"},"family_id":"qf-app21-lp-finite-optimum","batch_id":"batch-20261013-advance-20261021-r06-linear-programming-foundations","mko_ids":["mko-linear-programming"],"question_state":"candidate","english_state":"ai_candidate","processing_state":"second_context_reviewed","source_question_sha256":"67f86a5881e8324408fef27ee8bcea7e4ea3a9a5c249f910e5c78cca0002833f","derivation_sha256":"183ed1ddd72166042c7e4daf2e2bb6a0e28969257f6179b196790b9857b064c9"},{"question_id":"q-20261013-advance-20261021-r06-linear-programming-0090","number":2465,"title":{"zh-Hant":"第 2465 題：有限線性規劃候選","en":"Question 2465: All Tied Optimizers among the Explicit Feasible Candidates"},"family_id":"qf-app21-lp-finite-optimum","batch_id":"batch-20261013-advance-20261021-r06-linear-programming-foundations","mko_ids":["mko-linear-programming"],"question_state":"candidate","english_state":"ai_candidate","processing_state":"second_context_reviewed","source_question_sha256":"bde63d9fd0d1b73798e0cac0ba49c6ad6e228518aaa62003cea7729e58b2f07a","derivation_sha256":"c88caee3d0268a5c8bad3b475b3aeac3f58a79257109ccc2f2ee9ba79f84c4db"},{"question_id":"q-20261013-advance-20261021-r06-linear-programming-0091","number":2466,"title":{"zh-Hant":"第 2466 題：有限線性規劃候選","en":"Question 2466: All Tied Optimizers among the Explicit Feasible Candidates"},"family_id":"qf-app21-lp-finite-optimum","batch_id":"batch-20261013-advance-20261021-r06-linear-programming-foundations","mko_ids":["mko-linear-programming"],"question_state":"candidate","english_state":"ai_candidate","processing_state":"second_context_reviewed","source_question_sha256":"59ab563042953d602c42c4ee7fe83bacd51fd9f46e4fcc753f3bfaf33bfe3240","derivation_sha256":"0b54fd96c79bf5c03d0a3d4f1482a71acf2bed29dfe72710c073d168a3f07f47"},{"question_id":"q-20261013-advance-20261021-r06-linear-programming-0092","number":2467,"title":{"zh-Hant":"第 2467 題：有限線性規劃候選","en":"Question 2467: All Tied Optimizers among the Explicit Feasible Candidates"},"family_id":"qf-app21-lp-finite-optimum","batch_id":"batch-20261013-advance-20261021-r06-linear-programming-foundations","mko_ids":["mko-linear-programming"],"question_state":"candidate","english_state":"ai_candidate","processing_state":"second_context_reviewed","source_question_sha256":"3813066ebf1f48117bb17860c7f8d26aef1628d8926d498b056dc15d51f6b35e","derivation_sha256":"e5b1585b9ad601dde32e41cb4f8dc27e3e8bef41077f2bcf82a06bdc91cbf893"},{"question_id":"q-20261013-advance-20261021-r06-linear-programming-0093","number":2468,"title":{"zh-Hant":"第 2468 題：有限線性規劃候選","en":"Question 2468: All Tied Optimizers among the Explicit Feasible Candidates"},"family_id":"qf-app21-lp-finite-optimum","batch_id":"batch-20261013-advance-20261021-r06-linear-programming-foundations","mko_ids":["mko-linear-programming"],"question_state":"candidate","english_state":"ai_candidate","processing_state":"second_context_reviewed","source_question_sha256":"b57be1eecfba1fd9d3fe06d9c1d88d9af95c04a198fd267e3710bac9bc19836a","derivation_sha256":"0c7acbfd19561ae8e8655d3423b2bf8da6e22d0d6b8ca158f558a88aa054512e"},{"question_id":"q-20261013-advance-20261021-r06-linear-programming-0094","number":2469,"title":{"zh-Hant":"第 2469 題：有限線性規劃候選","en":"Question 2469: All Tied Optimizers among the Explicit Feasible Candidates"},"family_id":"qf-app21-lp-finite-optimum","batch_id":"batch-20261013-advance-20261021-r06-linear-programming-foundations","mko_ids":["mko-linear-programming"],"question_state":"candidate","english_state":"ai_candidate","processing_state":"second_context_reviewed","source_question_sha256":"030302a499730f6b01c7f7dc71ff0eb0afd116a35a8c51ef205b242e2607b5e3","derivation_sha256":"0bd9cae0c53b545836814a4dde8afdcfdc1b5a3aa173b16f5067b9f8de49b137"},{"question_id":"q-20261013-advance-20261021-r06-linear-programming-0095","number":2470,"title":{"zh-Hant":"第 2470 題：有限線性規劃候選","en":"Question 2470: All Tied Optimizers among the Explicit Feasible Candidates"},"family_id":"qf-app21-lp-finite-optimum","batch_id":"batch-20261013-advance-20261021-r06-linear-programming-foundations","mko_ids":["mko-linear-programming"],"question_state":"candidate","english_state":"ai_candidate","processing_state":"second_context_reviewed","source_question_sha256":"936c1bdf39fd6a917af3e1d96846057bdd4ceaa91175dc177512480010e602b6","derivation_sha256":"f1e8d1509eee55d2d3b495d682f1f40fb7da12f31f44ca739f6c293fec55f0bd"},{"question_id":"q-20261013-advance-20261021-r06-linear-programming-0096","number":2471,"title":{"zh-Hant":"第 2471 題：有限線性規劃候選","en":"Question 2471: All Tied Optimizers among the Explicit Feasible Candidates"},"family_id":"qf-app21-lp-finite-optimum","batch_id":"batch-20261013-advance-20261021-r06-linear-programming-foundations","mko_ids":["mko-linear-programming"],"question_state":"candidate","english_state":"ai_candidate","processing_state":"second_context_reviewed","source_question_sha256":"1c8908d5bc5437bdb6440bf08644467be4b2e0875ea3582611da03f97e1c5076","derivation_sha256":"611e22bcfb5c7b66122448af83813b2be7d32d22af51f0575d3233c4df3fde44"},{"question_id":"q-20261013-advance-20261021-r06-linear-programming-0097","number":2472,"title":{"zh-Hant":"第 2472 題：有限線性規劃候選","en":"Question 2472: All Tied Optimizers among the Explicit Feasible Candidates"},"family_id":"qf-app21-lp-finite-optimum","batch_id":"batch-20261013-advance-20261021-r06-linear-programming-foundations","mko_ids":["mko-linear-programming"],"question_state":"candidate","english_state":"ai_candidate","processing_state":"second_context_reviewed","source_question_sha256":"6e9bf103c27768c3d97387c26b3ed22065b55f4c57f4305da82c59a30e67db14","derivation_sha256":"ddb9dbbab3c87d4a7b471f9a2abda70325b8210567625a6f73da548d57fd1963"},{"question_id":"q-20261013-advance-20261021-r06-linear-programming-0098","number":2473,"title":{"zh-Hant":"第 2473 題：有限線性規劃候選","en":"Question 2473: All Tied Optimizers among the Explicit Feasible Candidates"},"family_id":"qf-app21-lp-finite-optimum","batch_id":"batch-20261013-advance-20261021-r06-linear-programming-foundations","mko_ids":["mko-linear-programming"],"question_state":"candidate","english_state":"ai_candidate","processing_state":"second_context_reviewed","source_question_sha256":"2a491175f16f8a00d8a24b1d341454c28e4b9a88e8f2c8da7c31352ddb145bb2","derivation_sha256":"d3fd7e138d40f6cfa9a9df3cb1736e7faa6f7281a72ef98ff1dbd85faa18bd87"},{"question_id":"q-20261013-advance-20261021-r06-linear-programming-0099","number":2474,"title":{"zh-Hant":"第 2474 題：有限線性規劃候選","en":"Question 2474: All Tied Optimizers among the Explicit Feasible Candidates"},"family_id":"qf-app21-lp-finite-optimum","batch_id":"batch-20261013-advance-20261021-r06-linear-programming-foundations","mko_ids":["mko-linear-programming"],"question_state":"candidate","english_state":"ai_candidate","processing_state":"second_context_reviewed","source_question_sha256":"b2f610e875552b54f01705c811015d1de30a72ed370355686e246a0dc91a6270","derivation_sha256":"f40a18bc51141d5c9bb6e6325eb3a9a84a4fb0af47a9de8b4fac88a0acd0caa1"},{"question_id":"q-20261013-advance-20261021-r06-linear-programming-0100","number":2475,"title":{"zh-Hant":"第 2475 題：有限線性規劃候選","en":"Question 2475: All Tied Optimizers among the Explicit Feasible Candidates"},"family_id":"qf-app21-lp-finite-optimum","batch_id":"batch-20261013-advance-20261021-r06-linear-programming-foundations","mko_ids":["mko-linear-programming"],"question_state":"candidate","english_state":"ai_candidate","processing_state":"second_context_reviewed","source_question_sha256":"701afb1109c3480dfcc25caebcd98f1470aed7573d949083b3279687bb522743","derivation_sha256":"b35f92fd58f4c6a127e09db80461f40b9eaacc2f82ef71ba564ef17cd7fd2e68"}]}