{
  "schema_version": "ocme-reviewed-question-reader-v1",
  "question_id": "q-20261013-advance-20261021-r06-linear-programming-0019",
  "pilot_number": "R0003-02419",
  "number": 2419,
  "family_id": "qf-app21-lp-constraint-row-audit",
  "title": {
    "zh-Hant": "第 2419 題：有限線性規劃候選",
    "en": "Question 2419: Every Constraint at One Declared Point"
  },
  "original_question": {
    "schema_version": "ocme-question-v0.1",
    "id": "q-20261013-advance-20261021-r06-linear-programming-0019",
    "batch_id": "batch-20261013-advance-20261021-r06-linear-programming-foundations",
    "language": "zh-Hant",
    "source_mko_ids": [
      "mko-linear-programming"
    ],
    "title_zh": "有限線性規劃候選",
    "stem_zh": "完整明示有限候選網格。操作=lp-constraint-row-audit；資料={\"point\":[3,2],\"constraints\":[[-1,0,0],[0,-1,0],[1,1,7]]}。請依 [point,constraint_rows,feasible] 欄序回答。",
    "answer": {
      "kind": "expression",
      "value": "([3, 2], [[-1, 0, 0, -3, 是], [0, -1, 0, -2, 是], [1, 1, 7, 5, 是]], 是)",
      "explanation_zh": "應用擴展核對=([3, 2], [[-1, 0, 0, -3, 是], [0, -1, 0, -2, 是], [1, 1, 7, 5, 是]], 是)；依完整明示資料重算；完整明示的有限／精確切片不是一般定理或人員判定；只稱所給候選中最佳；不宣稱一般LP全域最優。"
    },
    "difficulty": {
      "band": "undergraduate_core",
      "level": 3,
      "skills": [
        "有限線性規劃候選"
      ]
    },
    "variant": {
      "family_id": "qf-app21-lp-constraint-row-audit",
      "seed": 202610216019,
      "parameters": {
        "point": [
          3,
          2
        ],
        "constraints": [
          [
            -1,
            0,
            0
          ],
          [
            0,
            -1,
            0
          ],
          [
            1,
            1,
            7
          ]
        ],
        "domain": "Finite_linear_program_candidate_grid",
        "operation": "lp-constraint-row-audit",
        "semantic_template": "qf-app21-lp-constraint-row-audit/{\"constraints\":[[-1,0,0],[0,-1,0],[1,1,7]],\"point\":[3,2]}"
      }
    },
    "verification": {
      "status": "candidate",
      "checks": [
        "producer_exact_finite_model",
        "producer_source_snapshot_check",
        "producer_substantive_template_deduplication",
        "producer_json_schema"
      ],
      "warning_zh": "僅為產生端候選及自檢；主端須另驗，不構成人工審定、一般定理、真實學生診斷、經驗預測、Lean執行或形式Evidence。"
    },
    "provenance": {
      "generator_role": "question_producer",
      "generator_model": "model_unknown",
      "generated_at": "2026-10-13",
      "contract_version": "ocme-question-factory-v0.1"
    }
  },
  "original_english_edition": {
    "schema_version": "ocme-question-localization-v0.1",
    "question_id": "q-20261013-advance-20261021-r06-linear-programming-0019",
    "batch_id": "batch-20261013-advance-20261021-r06-linear-programming-foundations",
    "locale": "en",
    "translation_state": "ai_candidate",
    "source": {
      "question_sha256": "54d95b1d270db9aee0c91c3388e0dff5fa641bf03b73a9bad5be2b41acee8c94",
      "family_id": "qf-app21-lp-constraint-row-audit",
      "seed": 202610216019,
      "semantic_template": "qf-app21-lp-constraint-row-audit/{\"constraints\":[[-1,0,0],[0,-1,0],[1,1,7]],\"point\":[3,2]}"
    },
    "fields": {
      "title": "Every Constraint at One Declared Point",
      "stem": "Use the complete explicitly supplied finite candidate grid, integer constraints A*x+B*y≤c and linear objective u*x+v*y. Feasibility precedes objective comparison; an optimum among these candidates is not a general continuous-domain LP optimum or dual certificate. point=[3, 2], constraints [A,B,c]=[[-1, 0, 0], [0, -1, 0], [1, 1, 7]]. Normalize tuple collections by removing identical tuples and sorting their JSON strings with the source’s en-locale comparison. This is canonical record order, not numerical coordinate order; number any output rows from 0 only after that normalization. Give (point,every [A,B,c,A*x+B*y,satisfies?] row,all constraints hold?).",
      "answer": {
        "kind": "expression",
        "value": "([3, 2], [[-1, 0, 0, -3, Yes], [0, -1, 0, -2, Yes], [1, 1, 7, 5, Yes]], Yes)",
        "explanation": "Check each inequality including equality at the boundary; infeasible candidates cannot be optimizers merely because their objective is better. This explicit finite/exact slice is neither a general theorem nor a judgment about a person. The exact result, retaining the requested order, is ([3, 2], [[-1, 0, 0, -3, Yes], [0, -1, 0, -2, Yes], [1, 1, 7, 5, Yes]], Yes)."
      },
      "skills": [
        "Every Constraint at One Declared Point"
      ],
      "verification_warning": "This is a candidate exercise. Mechanical recomputation checks only the stated conditions and this instance; it is neither a formal proof nor human review."
    }
  },
  "givens": [
    {
      "id": "G001",
      "text": {
        "zh-Hant": "完整明示有限候選網格。操作=lp-constraint-row-audit；資料={\"point\":[3,2],\"constraints\":[[-1,0,0],[0,-1,0],[1,1,7]]}。請依 [point,constraint_rows,feasible] 欄序回答。",
        "en": "Use the complete explicitly supplied finite candidate grid, integer constraints A*x+B*y≤c and linear objective u*x+v*y. Feasibility precedes objective comparison; an optimum among these candidates is not a general continuous-domain LP optimum or dual certificate. point=[3, 2], constraints [A,B,c]=[[-1, 0, 0], [0, -1, 0], [1, 1, 7]]. Normalize tuple collections by removing identical tuples and sorting their JSON strings with the source’s en-locale comparison. This is canonical record order, not numerical coordinate order; number any output rows from 0 only after that normalization. Give (point,every [A,B,c,A*x+B*y,satisfies?] row,all constraints hold?)."
      }
    }
  ],
  "steps": [
    {
      "id": "S001",
      "uses": [
        "G001"
      ],
      "before": "explicit finite candidate grid and linear rows a·x+b·y≤c",
      "after": "keep candidate-grid optimization separate from continuous LP",
      "relation": "implies",
      "rule_id": "finite_LP_scope",
      "conditions": [],
      "explanation": {
        "zh-Hant": "本題只在列出的有限候選中核對；未提供完整頂點或全可行域證書，不宣稱一般連續LP全域最優。",
        "en": "Audit only the listed finite candidates;without a complete-vertex or full-feasible-domain certificate,this is not a general continuous-LP optimum claim."
      },
      "reverse_audit": {
        "kind": "premise_and_result_audit",
        "explanation": {
          "zh-Hant": "回到原始資料與本步條件核對，不把單向推論誤稱等價。",
          "en": "Check against the original data and this step's premises; a one-way implication is not an equivalence."
        }
      },
      "arithmetic": null
    },
    {
      "id": "S002",
      "uses": [
        "G001",
        "S001"
      ],
      "before": "point row0 a·x := mul(-1, 3)",
      "after": "point row0 a·x = -3",
      "relation": "calculation",
      "rule_id": "exact_rational_arithmetic",
      "conditions": [],
      "explanation": {
        "zh-Hant": "第一座標乘自己的列係數。",
        "en": "Multiply the first coordinate by its row coefficient."
      },
      "reverse_audit": {
        "kind": "premise_and_result_audit",
        "explanation": {
          "zh-Hant": "以精確有理數重算 point row0 a·x，不以小數近似替代。",
          "en": "Recompute point row0 a·x with exact rational arithmetic, not rounded decimals."
        }
      },
      "arithmetic": {
        "operation": "mul",
        "inputs": [
          "-1",
          "3"
        ],
        "output": "-3",
        "label": "point row0 a·x"
      }
    },
    {
      "id": "S003",
      "uses": [
        "G001",
        "S002"
      ],
      "before": "point row0 b·y := mul(0, 2)",
      "after": "point row0 b·y = 0",
      "relation": "calculation",
      "rule_id": "exact_rational_arithmetic",
      "conditions": [],
      "explanation": {
        "zh-Hant": "第二座標也按同一欄序計算。",
        "en": "Compute the second coordinate in the same declared order."
      },
      "reverse_audit": {
        "kind": "premise_and_result_audit",
        "explanation": {
          "zh-Hant": "以精確有理數重算 point row0 b·y，不以小數近似替代。",
          "en": "Recompute point row0 b·y with exact rational arithmetic, not rounded decimals."
        }
      },
      "arithmetic": {
        "operation": "mul",
        "inputs": [
          "0",
          "2"
        ],
        "output": "0",
        "label": "point row0 b·y"
      }
    },
    {
      "id": "S004",
      "uses": [
        "G001",
        "S003"
      ],
      "before": "point row0 LHS := sum(-3, 0)",
      "after": "point row0 LHS = -3",
      "relation": "calculation",
      "rule_id": "exact_rational_arithmetic",
      "conditions": [],
      "explanation": {
        "zh-Hant": "相加後才比較整列不等式。",
        "en": "Add before comparing the complete row inequality."
      },
      "reverse_audit": {
        "kind": "premise_and_result_audit",
        "explanation": {
          "zh-Hant": "以精確有理數重算 point row0 LHS，不以小數近似替代。",
          "en": "Recompute point row0 LHS with exact rational arithmetic, not rounded decimals."
        }
      },
      "arithmetic": {
        "operation": "sum",
        "inputs": [
          "-3",
          "0"
        ],
        "output": "-3",
        "label": "point row0 LHS"
      }
    },
    {
      "id": "S005",
      "uses": [
        "G001",
        "S004"
      ],
      "before": "row0: -3≤0",
      "after": "satisfied=是",
      "relation": "implies",
      "rule_id": "inclusive_constraint",
      "conditions": [],
      "explanation": {
        "zh-Hant": "等號允許，負係數已在乘法中保留；不用任意改不等號方向。",
        "en": "Equality is allowed and negative coefficients remain in the products;do not arbitrarily reverse the inequality."
      },
      "reverse_audit": {
        "kind": "premise_and_result_audit",
        "explanation": {
          "zh-Hant": "回到原始資料與本步條件核對，不把單向推論誤稱等價。",
          "en": "Check against the original data and this step's premises; a one-way implication is not an equivalence."
        }
      },
      "arithmetic": null
    },
    {
      "id": "S006",
      "uses": [
        "G001",
        "S005"
      ],
      "before": "point row1 a·x := mul(0, 3)",
      "after": "point row1 a·x = 0",
      "relation": "calculation",
      "rule_id": "exact_rational_arithmetic",
      "conditions": [],
      "explanation": {
        "zh-Hant": "第一座標乘自己的列係數。",
        "en": "Multiply the first coordinate by its row coefficient."
      },
      "reverse_audit": {
        "kind": "premise_and_result_audit",
        "explanation": {
          "zh-Hant": "以精確有理數重算 point row1 a·x，不以小數近似替代。",
          "en": "Recompute point row1 a·x with exact rational arithmetic, not rounded decimals."
        }
      },
      "arithmetic": {
        "operation": "mul",
        "inputs": [
          "0",
          "3"
        ],
        "output": "0",
        "label": "point row1 a·x"
      }
    },
    {
      "id": "S007",
      "uses": [
        "G001",
        "S006"
      ],
      "before": "point row1 b·y := mul(-1, 2)",
      "after": "point row1 b·y = -2",
      "relation": "calculation",
      "rule_id": "exact_rational_arithmetic",
      "conditions": [],
      "explanation": {
        "zh-Hant": "第二座標也按同一欄序計算。",
        "en": "Compute the second coordinate in the same declared order."
      },
      "reverse_audit": {
        "kind": "premise_and_result_audit",
        "explanation": {
          "zh-Hant": "以精確有理數重算 point row1 b·y，不以小數近似替代。",
          "en": "Recompute point row1 b·y with exact rational arithmetic, not rounded decimals."
        }
      },
      "arithmetic": {
        "operation": "mul",
        "inputs": [
          "-1",
          "2"
        ],
        "output": "-2",
        "label": "point row1 b·y"
      }
    },
    {
      "id": "S008",
      "uses": [
        "G001",
        "S007"
      ],
      "before": "point row1 LHS := sum(0, -2)",
      "after": "point row1 LHS = -2",
      "relation": "calculation",
      "rule_id": "exact_rational_arithmetic",
      "conditions": [],
      "explanation": {
        "zh-Hant": "相加後才比較整列不等式。",
        "en": "Add before comparing the complete row inequality."
      },
      "reverse_audit": {
        "kind": "premise_and_result_audit",
        "explanation": {
          "zh-Hant": "以精確有理數重算 point row1 LHS，不以小數近似替代。",
          "en": "Recompute point row1 LHS with exact rational arithmetic, not rounded decimals."
        }
      },
      "arithmetic": {
        "operation": "sum",
        "inputs": [
          "0",
          "-2"
        ],
        "output": "-2",
        "label": "point row1 LHS"
      }
    },
    {
      "id": "S009",
      "uses": [
        "G001",
        "S008"
      ],
      "before": "row1: -2≤0",
      "after": "satisfied=是",
      "relation": "implies",
      "rule_id": "inclusive_constraint",
      "conditions": [],
      "explanation": {
        "zh-Hant": "等號允許，負係數已在乘法中保留；不用任意改不等號方向。",
        "en": "Equality is allowed and negative coefficients remain in the products;do not arbitrarily reverse the inequality."
      },
      "reverse_audit": {
        "kind": "premise_and_result_audit",
        "explanation": {
          "zh-Hant": "回到原始資料與本步條件核對，不把單向推論誤稱等價。",
          "en": "Check against the original data and this step's premises; a one-way implication is not an equivalence."
        }
      },
      "arithmetic": null
    },
    {
      "id": "S010",
      "uses": [
        "G001",
        "S009"
      ],
      "before": "point row2 a·x := mul(1, 3)",
      "after": "point row2 a·x = 3",
      "relation": "calculation",
      "rule_id": "exact_rational_arithmetic",
      "conditions": [],
      "explanation": {
        "zh-Hant": "第一座標乘自己的列係數。",
        "en": "Multiply the first coordinate by its row coefficient."
      },
      "reverse_audit": {
        "kind": "premise_and_result_audit",
        "explanation": {
          "zh-Hant": "以精確有理數重算 point row2 a·x，不以小數近似替代。",
          "en": "Recompute point row2 a·x with exact rational arithmetic, not rounded decimals."
        }
      },
      "arithmetic": {
        "operation": "mul",
        "inputs": [
          "1",
          "3"
        ],
        "output": "3",
        "label": "point row2 a·x"
      }
    },
    {
      "id": "S011",
      "uses": [
        "G001",
        "S010"
      ],
      "before": "point row2 b·y := mul(1, 2)",
      "after": "point row2 b·y = 2",
      "relation": "calculation",
      "rule_id": "exact_rational_arithmetic",
      "conditions": [],
      "explanation": {
        "zh-Hant": "第二座標也按同一欄序計算。",
        "en": "Compute the second coordinate in the same declared order."
      },
      "reverse_audit": {
        "kind": "premise_and_result_audit",
        "explanation": {
          "zh-Hant": "以精確有理數重算 point row2 b·y，不以小數近似替代。",
          "en": "Recompute point row2 b·y with exact rational arithmetic, not rounded decimals."
        }
      },
      "arithmetic": {
        "operation": "mul",
        "inputs": [
          "1",
          "2"
        ],
        "output": "2",
        "label": "point row2 b·y"
      }
    },
    {
      "id": "S012",
      "uses": [
        "G001",
        "S011"
      ],
      "before": "point row2 LHS := sum(3, 2)",
      "after": "point row2 LHS = 5",
      "relation": "calculation",
      "rule_id": "exact_rational_arithmetic",
      "conditions": [],
      "explanation": {
        "zh-Hant": "相加後才比較整列不等式。",
        "en": "Add before comparing the complete row inequality."
      },
      "reverse_audit": {
        "kind": "premise_and_result_audit",
        "explanation": {
          "zh-Hant": "以精確有理數重算 point row2 LHS，不以小數近似替代。",
          "en": "Recompute point row2 LHS with exact rational arithmetic, not rounded decimals."
        }
      },
      "arithmetic": {
        "operation": "sum",
        "inputs": [
          "3",
          "2"
        ],
        "output": "5",
        "label": "point row2 LHS"
      }
    },
    {
      "id": "S013",
      "uses": [
        "G001",
        "S012"
      ],
      "before": "row2: 5≤7",
      "after": "satisfied=是",
      "relation": "implies",
      "rule_id": "inclusive_constraint",
      "conditions": [],
      "explanation": {
        "zh-Hant": "等號允許，負係數已在乘法中保留；不用任意改不等號方向。",
        "en": "Equality is allowed and negative coefficients remain in the products;do not arbitrarily reverse the inequality."
      },
      "reverse_audit": {
        "kind": "premise_and_result_audit",
        "explanation": {
          "zh-Hant": "回到原始資料與本步條件核對，不把單向推論誤稱等價。",
          "en": "Check against the original data and this step's premises; a one-way implication is not an equivalence."
        }
      },
      "arithmetic": null
    },
    {
      "id": "S014",
      "uses": [
        "G001",
        "S013"
      ],
      "before": "[是, 是, 是]",
      "after": "feasible for all supplied rows=是",
      "relation": "implies",
      "rule_id": "constraint_conjunction",
      "conditions": [],
      "explanation": {
        "zh-Hant": "一點必須通過每個條件，不能只核對其中一列。",
        "en": "A point must pass every supplied constraint,not just one row."
      },
      "reverse_audit": {
        "kind": "premise_and_result_audit",
        "explanation": {
          "zh-Hant": "回到原始資料與本步條件核對，不把單向推論誤稱等價。",
          "en": "Check against the original data and this step's premises; a one-way implication is not an equivalence."
        }
      },
      "arithmetic": null
    }
  ],
  "math_model": {
    "result": [
      [
        3,
        2
      ],
      [
        [
          -1,
          0,
          0,
          "-3",
          true
        ],
        [
          0,
          -1,
          0,
          "-2",
          true
        ],
        [
          1,
          1,
          7,
          "5",
          true
        ]
      ],
      true
    ],
    "claim_scope": "listed_linear_rows"
  },
  "conclusion": {
    "canonical_value": "([3, 2], [[-1, 0, 0, -3, 是], [0, -1, 0, -2, 是], [1, 1, 7, 5, 是]], 是)",
    "explanation": {
      "zh-Hant": "依上列完整代值及條件核對得到原題答案；原題編號、格式與狀態保持不變。",
      "en": "The full substitutions and premise checks give the original answer; source identity,format and status are unchanged."
    }
  },
  "definition_note": {
    "zh-Hant": "沿用原題明示的論域、假設與來源 MKO 定義。本題已完成第二對話數理與中英語義覆核，並由原始參數逐題獨立重算模型、答案與每個算術步驟；原題仍為 candidate。",
    "en": "Use the original question domain, assumptions and cited MKO definitions. This item has second-context mathematical and bilingual review, with the model, answer and every arithmetic step independently recomputed from the original parameters; the source question remains a candidate."
  },
  "source": {
    "input_commit": "0f7be61e2c22317a4075561dc822c87d881a50db",
    "question_binding": {
      "batch_id": "batch-20261013-advance-20261021-r06-linear-programming-foundations",
      "batch_path": "public/data/questions/batches/batch-20261013-advance-20261021-r06-linear-programming-foundations/questions.jsonl",
      "batch_sha256": "4f359198d877f6deb65f90624f20b930560aaea99c5c0bb90a9f1cdd464ff288",
      "original_line": 19,
      "original_line_sha256": "4e454e65112f7e369cc28c8bd2e8354812cefe3bea03fec656f49f8ec8ed82c6",
      "question_compact_sha256": "54d95b1d270db9aee0c91c3388e0dff5fa641bf03b73a9bad5be2b41acee8c94",
      "english_row_compact_sha256": "961b827cc24c50969f0362050dd195ae0b2cadec5dfe49cf285694d13ce8e88f",
      "english_manifest_path": "public/data/i18n/editions/batch-20261013-advance-20261021-r06-linear-programming-foundations.en.json",
      "english_rows_path": "public/data/i18n/questions/batch-20261013-advance-20261021-r06-linear-programming-foundations.en.jsonl"
    },
    "mko_bindings": {
      "mko-linear-programming": {
        "sha256": "e954454f13d345f635417e689ccae76261e754c182baf343173c0279585e8ba4",
        "english_sha256": "b16ebfdf1e39849a91ad524e7052c80e4c5e21153a5faf6290fd437bb617a283",
        "original_path": "public/data/mko/linear-programming.json",
        "english_path": "public/data/i18n/editions/mko-linear-programming.en.json"
      }
    },
    "selected_manifest_sha256": "5233edba9654a6cffd8b6b2d83c932f82ded15f9c0b7c733bd049943e672acff",
    "selected_part_sha256": "09b39eb68bdeb3e1e4277f359de31284852356add54b99a43cf1e38a33d69d15",
    "original_candidate_sha256": "13b179c08d9ad523089e0acf28c8da704d1e5150efd5248e70e472452594cdc9",
    "original_candidate_line_sha256": "13b179c08d9ad523089e0acf28c8da704d1e5150efd5248e70e472452594cdc9"
  },
  "historical_source_state": {
    "review_state": {
      "derivation": "candidate_authored_and_locally_checked",
      "source_question_state": "candidate",
      "independent_AI_or_human_review": "NOT_PERFORMED",
      "formalization": "not_formalized",
      "Lean": "NOT_RUN"
    },
    "scope_note": {
      "zh-Hant": "來源綁定教學推導候選；精確核對不等於獨立AI／人工審查或一般形式證明。原題、答案、MKO、公式、AST與歷史不變。",
      "en": "Source-bound pedagogical derivation candidate.Exact checking is not independent AI/human review or general formal proof.Original questions,answers,MKOs,formulas,ASTs and history remain unchanged."
    },
    "label": "Frozen producer metadata; current per-question review is separate below."
  },
  "revision": {
    "id": "review-20261026-004-p4",
    "review_date": "2026-10-26",
    "owner_authorized_reader_publication": true,
    "scope": "One hundred sixty family prototypes and their mathematical/bilingual reasoning variants, stems, boundary statements and every distinct explanation shape were reviewed in a context independent of the producer; parameter substitutions, source bindings, full math models, both answer strings and every arithmetic step were independently reconstructed per question from the original parameters only, with negative controls. This grouped method does not claim a separate literal AI reading of every repeated sentence or an extra AI voter.",
    "review_receipts": {
      "semantic_review_sha256": "5dbc70ebd5f74b23384c93b63a2b1d6519e206c79f22ae16a6c2d7483cea783f",
      "question_first_witness_sha256": "cf121c8dd2fec13aa118b04b049ee39494f1d6d9ecdc13514cafb78c0fc021fa"
    },
    "status": "second_context_reviewed",
    "mathematical_semantics": true,
    "bilingual_semantics": true,
    "steps_reviewed": 14,
    "method": "family_template_semantic_review_plus_independent_per_instance_reconstruction",
    "exact_question_first_check": {
      "model_sha256": "fc697da1371c169a8bd36c9eaf645a76f2f2064a212f4cb798fdab019d0adab7",
      "arithmetic_steps": 9
    },
    "uses_answer_as_premise": false,
    "human_review": "NOT_PERFORMED",
    "formalization": "not_formalized",
    "Lean": "NOT_RUN",
    "Canonical_truth_promotion": false,
    "authority": "Owner-authorized reviewed reader publication; original question/candidate states remain historical and unchanged."
  }
}