# OCME · 知識與練習查找

302 MKO / 1,441 families / 360 batches / 36,000 questions.

36,000 second-context math/bilingual reviewed; 0 display/symbol-checked candidates. Source questions: candidate. English: ai_candidate. No new proof, Lean, SREG or training.

1 results; page 1/1.

## 第 2445 題：有限線性規劃候選

- ID: `q-20261013-advance-20261021-r06-linear-programming-0045`; number: 2445
- Processing: second_context_reviewed
- MKO: [mko-linear-programming](/zh-Hant/mko/mko-linear-programming/)
- Family: [qf-app21-lp-feasible-inventory](/zh-Hant/explore/?family=qf-app21-lp-feasible-inventory)
- Batch: [batch-20261013-advance-20261021-r06-linear-programming-foundations](/zh-Hant/explore/?batch=batch-20261013-advance-20261021-r06-linear-programming-foundations)
- [Derivation](/zh-Hant/questions/q-20261013-advance-20261021-r06-linear-programming-0045/) / [Markdown](/zh-Hant/questions/q-20261013-advance-20261021-r06-linear-programming-0045/index.md) / [JSON](/data/question-derivations/questions/q-20261013-advance-20261021-r06-linear-programming-0045.json)